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.

[1]  Luís Moniz Pereira,et al.  Selected papers from the Non-Monotonic Extensions of Logic Programming , 1996 .

[2]  Jeroen Janssen.  Foundations of fuzzy answer set programming , 2011 .

[3]  Umberto Straccia,et al.  On Fixed-Points of Multivalued Functions on Complete Lattices and Their Application to Generalized Logic Programs , 2008, SIAM J. Comput..

[4]  Vladimir Lifschitz,et al.  Extended Logic Programs as Autoepistemic Theories , 1993, LPNMR.

[5]  Umberto Straccia.  Annotated Answer Set Programming , 2006 .

[6]  Martine De Cock,et al.  Fuzzy Autoepistemic Logic: Reflecting about Knowledge of Truth Degrees , 2011, ECSQARU.

[7]  Gerhard Brewka.  Preferences in Answer Set Programming , 2005, CAEPIA.

[8]  Igor Stéphan,et al.  Possibilistic uncertainty handling for answer set programming , 2006, Annals of Mathematics and Artificial Intelligence.

[9]  Martine De Cock,et al.  Answer Sets in a Fuzzy Equilibrium Logic , 2009, RR.

[10]  Xiaoqiao Meng,et al.  Real-time forest fire detection with wireless sensor networks , 2005, Proceedings. 2005 International Conference on Wireless Communications, Networking and Mobile Computing, 2005..

[11]  Petr Hájek,et al.  Metamathematics of Fuzzy Logic , 1998, Trends in Logic.

[12]  Agata Ciabattoni,et al.  Two Connections Between Linear Logic and Lukasiewicz Logics , 1997, Kurt Gödel Colloquium.

[13]  David Pearce,et al.  A New Logical Characterisation of Stable Models and Answer Sets , 1996, NMELP.

[14]  Angus Macintyre,et al.  Trends in Logic , 2001 .

[15]  Raymond Reiter,et al.  A Logic for Default Reasoning , 1987, Artif. Intell..

[16]  Robert C. Moore.  Semantical Considerations on Nonmonotonic Logic , 1985, IJCAI.

[17]  Stijn Heymans,et al.  Cooperating Answer Set Programming , 2006, ICLP.

[18]  Martine De Cock,et al.  Complexity of fuzzy answer set programming under Łukasiewicz semantics , 2014, Int. J. Approx. Reason..

[19]  Martine De Cock,et al.  An introduction to fuzzy answer set programming , 2007, Annals of Mathematics and Artificial Intelligence.

[20]  Jürgen Dix,et al.  Non-Monotonic Extensions of Logic Programming , 1996, Lecture Notes in Computer Science.

[21]  Vincent Danos,et al.  The Structure of Exponentials: Uncovering the Dynamics of Linear Logic Proofs , 1993, Kurt Gödel Colloquium.

[22]  Chitta Baral,et al.  Logic Programming and Knowledge Representation , 1994, J. Log. Program..

[23]  J. Nelson Rushton,et al.  Probabilistic Reasoning With Answer Sets , 2004, LPNMR.

[24]  Chitta Baral,et al.  Knowledge Representation, Reasoning and Declarative Problem Solving , 2003 .

[25]  Martine De Cock,et al.  General Fuzzy Answer Set Programs , 2009, WILF.

[26]  Cristina Sirangelo,et al.  Reasoning About Pattern-Based XML Queries , 2013, RR.

[27]  Wolfgang Faber,et al.  Logic Programming and Nonmonotonic Reasoning , 2011, Lecture Notes in Computer Science.

[28]  Thomas Lukasiewicz.  Fuzzy Description Logic Programs under the Answer Set Semantics for the Semantic Web , 2006, RuleML.

[29]  Witold Pedrycz,et al.  Fuzzy Logic and Applications , 2013, Lecture Notes in Computer Science.

[30]  Robert McNaughton,et al.  A Theorem About Infinite-Valued Sentential Logic , 1951, J. Symb. Log..

[31]  Luís Moniz Pereira,et al.  Antitonic Logic Programs , 2001, LPNMR.

[32]  Michael Clarke,et al.  Symbolic and Quantitative Approaches to Reasoning and Uncertainty , 1991, Lecture Notes in Computer Science.

[33]  Reiner Hähnle.  Proof theory of many-valued logic—linear optimization—logic design: connections and interactions , 1997, Soft Comput..

[34]  Didier Dubois,et al.  Possibility Theory, Probability Theory and Multiple-Valued Logics: A Clarification , 2001, Annals of Mathematics and Artificial Intelligence.