Fuzzy answer set programming with literal preferences
Jeroen Janssen, Steven Schockaert, Dirk Vermeir, Martine De Cock · 2009
Abstract — In the current approaches to fuzzy answer set pro-gramming (FASP) one can state preferences amongst rules to denote their relative importance. However, in many situations we need more complex preferences such as those in the answer set optimization framework proposed by Brewka for crisp answer set programming. Unfortunately, these complex preferences do not readily fit into the current FASP approaches. In this paper we propose a language to state such preferences and show that programs with these preferences can be translated into equivalent general fuzzy answer set program-ming (gFASP) programs. This not only provides an implementation method, but also shows that this extension can be added as syntactic sugar on top of general fuzzy answer set programming solvers.