Fuzzy Answer Set Programming: An Introduction
نویسندگان
چکیده
In this chapter, we present a tutorial about fuzzy answer set programming (FASP); we give a gentle introduction to its basic ideas and definitions. FASP is a combination of answer set programming and fuzzy logics which has recently been proposed. From the answer set semantics, FASP inherits the declarative nonmonotonic reasoning capabilities, while fuzzy logic adds the power to model continuous problems. FASP can be tailored towards different applications since fuzzy logics gives a great flexibility, e.g. by the possibility to use different generalizations of the classical connectives. In this chapter, we consider a rather general form of FASP programs; the connectives can in principal be interpreted by arbitrary [0,1]n→ [0,1]mappings. Despite that very general connectives are allowed, the presented framework turns out to be an intuitive extension of answer set programming.
منابع مشابه
Answer Sets in a Fuzzy Equilibrium Logic
Since its introduction, answer set programming has been generalized in many directions, to cater to the needs of real-world applications. As one of the most general “classical” approaches, answer sets of arbitrary propositional theories can be defined as models in the equilibrium logic of Pearce. Fuzzy answer set programming, on the other hand, extends answer set programming with the capability...
متن کاملFuzzy Aggregates in Fuzzy Answer Set Programming
Fuzzy answer set programming [Saad, 2010; Saad, 2009; Subrahmanian, 1994] is a declarative framework for representing and reasoning about knowledge in fuzzy environments. However, the unavailability of fuzzy aggregates in disjunctive fuzzy logic programs, DFLP, with fuzzy answer set semantics [Saad, 2010] prohibits the natural and concise representation of many interesting problems. In this pap...
متن کاملCompiling Fuzzy Answer Set Programs to Fuzzy Propositional Theories
We show how a fuzzy answer set program can be compiled to an equivalent fuzzy propositional theory whose models correspond to the answer sets of the program. This creates a basis for constructing fuzzy answer set solvers, such as solvers based on fuzzy SAT-solvers or on linear programming.
متن کاملFuzzy Answer Set Programming with Literal Preferences
In the current approaches to fuzzy answer set programming (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 appr...
متن کاملFuzzy autoepistemic logic and its relation to fuzzy answer set programming
Autoepistemic logic is an important formalism for nonmonotonic reasoning. It extends propositional logic by offering the ability to reason about an agent’s (lack of) beliefs. Moreover, it is well known to generalize the stable model semantics of answer set programming. Fuzzy logics on the other hand are multi-valued logics, which allow to model the intensity to which properties are satisfied. W...
متن کامل