FLP Semantics Without Circular Justifications for General Logic Programs

The FLP semantics presented by (Faber, Leone, and Pfeifer 2004) has been widely used to define answer sets, called FLP answer sets, for different types of logic programs such as logic programs with aggregates, description logic programs (dl-programs), Hex programs, and logic programs with first-order formulas (general logic programs). However, it was recently observed that the FLP semantics may produce unintuitive answer sets with circular justifications caused by self-supporting loops. In this paper, we address the circular justification problem for general logic programs by enhancing the FLP semantics with a level mapping formalism. In particular, we extend the Gelfond-Lifschitz three step definition of the standard answer set semantics from normal logic programs to general logic programs and define for general logic programs the first FLP semantics that is free of circular justifications.We call this FLP semantics the well-justified FLP semantics. This method naturally extends to general logic programs with additional constraints like aggregates, thus providing a unifying framework for defining the well-justified FLP semantics for various types of logic programs. When this method is applied to normal logic programs with aggregates, the well-justified FLP semantics agrees with the conditional satisfaction based semantics defined by (Son, Pontelli, and Tu 2007); and when applied to dl-programs, the semantics agrees with the strongly well-supported semantics defined by (Shen 2011).

[1]  Nils J. Nilsson,et al.  Artificial Intelligence , 1974, IFIP Congress.

[2]  Wolfgang Faber,et al.  Recursive Aggregates in Disjunctive Logic Programs: Semantics and Complexity , 2004, JELIA.

[3]  Thomas Eiter,et al.  Modular Nonmonotonic Logic Programming Revisited , 2009, ICLP.

[4]  José Júlio Alferes,et al.  Logics in Artificial Intelligence: European Workshop, JELIA '96, Evora, Portugal, September 30 - October 3, 1996, Proceedings , 1996 .

[5]  Miroslaw Truszczynski.  Reducts of propositional theories, satisfiability relations, and generalizations of semantics of logic programs , 2010, Artif. Intell..

[6]  Hans Tompits,et al.  Combining answer set programming with description logics for the Semantic Web , 2004, Artif. Intell..

[7]  Boris Motik,et al.  Reconciling description logics and rules , 2010, JACM.

[8]  François Fages,et al.  Consistency of Clark's completion and existence of stable models , 1992, Methods Log. Comput. Sci..

[9]  Victor W. Marek,et al.  Logic Programs with Abstract Constraint Atoms , 2004, AAAI.

[10]  Robert A. Kowalski,et al.  The Semantics of Predicate Logic as a Programming Language , 1976, JACM.

[11]  Jia-Huai You,et al.  A Default Approach to Semantics of Logic Programs with Constraint Atoms , 2009, LPNMR.

[12]  Paolo Ferraris,et al.  Answer Sets for Propositional Theories , 2005, LPNMR.

[13]  Thomas Lukasiewicz.  A Novel Combination of Answer Set Programming with Description Logics for the Semantic Web , 2007, ESWC.

[14]  Yi-Dong Shen,et al.  Well-Supported Semantics for Description Logic Programs , 2011, IJCAI.

[15]  Diego Calvanese,et al.  The Description Logic Handbook: Theory, Implementation, and Applications , 2003, Description Logic Handbook.

[16]  Joohyung Lee,et al.  Stable models and circumscription , 2011, Artif. Intell..

[17]  John McCarthy,et al.  Addendum: Circumscription and other Non-Monotonic Formalisms , 1980, Artif. Intell..

[18]  Wolfgang Faber,et al.  Semantics and complexity of recursive aggregates in answer set programming , 2011, Artif. Intell..

[19]  Enrico Pontelli,et al.  Answer Sets for Logic Programs with Arbitrary Abstract Constraint Atoms , 2006, AAAI.

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

[21]  Joohyung Lee,et al.  First-Order Extension of the FLP Stable Model Semantics via Modified Circumscription , 2011, IJCAI.

[22]  Vladimir Lifschitz,et al.  Thirteen Definitions of a Stable Model , 2010, Fields of Logic and Computation.

[23]  Hans Tompits,et al.  A Uniform Integration of Higher-Order Reasoning and External Evaluations in Answer-Set Programming , 2005, IJCAI.

[24]  Kewen Wang,et al.  Extending Logic Programs with Description Logic Expressions for the Semantic Web , 2011, SEMWEB.

[25]  Miroslaw Truszczynski,et al.  Logic programs with abstract constraint atoms: The role of computations , 2007, Artif. Intell..

[26]  Bernd Finkbeiner,et al.  Fields of Logic and Computation , 2011 .