Well-Supported Semantics for Logic Programs with Generalized Rules

Logic programming under the stable model semantics has been extended to arbitrary formulas. A question of interest is how to characterize the property of well-supportedness, in the sense of Fages, which has been considered a cornerstone in answer set programming. In this paper, we address this issue by considering general logic programs, which consist of disjunctive rules with arbitrary propositional formulas in rule bodies. We define the justified stable semantics for these programs, propose a general notion of well-supportedness, and show the relationships between the two. We address the issue of computational complexity for various classes of general programs. Finally, we show that previously proposed well-supported semantics for aggregate programs and description logic programs are rooted in the justified stable semantics of general programs.

[1]  Maurice Bruynooghe,et al.  Partial Stable Models for Logic Programs with Aggregates , 2004, LPNMR.

[2]  Yi Zhou,et al.  Progression Semantics for Disjunctive Logic Programs , 2011, AAAI.

[3]  Georg Gottlob,et al.  Complexity and expressive power of logic programming , 1997, Proceedings of Computational Complexity. Twelfth Annual IEEE Conference.

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

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

[6]  Hai Wan,et al.  dl2asp: Implementing Default Logic via Answer Set Programming , 2010, JELIA.

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

[8]  Miroslaw Truszczynski,et al.  Modal Interpretations of Default Logic , 1991, IJCAI.

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

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

[11]  Victor W. Marek,et al.  Ultimate approximation and its application in nonmonotonic knowledge representation systems , 2004, Inf. Comput..

[12]  Enrico Pontelli,et al.  A Constructive semantic characterization of aggregates in answer set programming , 2007, Theory Pract. Log. Program..

[13]  Georg Gottlob,et al.  On the computational cost of disjunctive logic programming: Propositional case , 1995, Annals of Mathematics and Artificial Intelligence.

[14]  Krzysztof R. Apt,et al.  Logic Programming , 1990, Handbook of Theoretical Computer Science, Volume B: Formal Models and Sematics.

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

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

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

[18]  Maurice Bruynooghe,et al.  Well-founded and stable semantics of logic programs with aggregates , 2007, Theory Pract. Log. Program..

[19]  Wolfgang Faber,et al.  Declarative and Computational Properties of Logic Programs with Aggregates , 2005, IJCAI.

[20]  Vladimir Lifschitz,et al.  Nested expressions in logic programs , 1999, Annals of Mathematics and Artificial Intelligence.

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

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

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

[24]  Frank Wolter,et al.  Semi-qualitative Reasoning about Distances: A Preliminary Report , 2000, JELIA.

[25]  A RossKenneth,et al.  The well-founded semantics for general logic programs , 1991 .

[26]  Miroslaw Truszczynzki.  Modal interpretations of default logic , 1991, IJCAI 1991.

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

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

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

[30]  Miroslaw Truszczynski,et al.  Nonmonotonic Reasoning is Sometimes Simpler , 1993, Kurt Gödel Colloquium.

[31]  Vladimir Lifschitz,et al.  Twelve Definitions of a Stable Model , 2008, ICLP.

[32]  Georg Gottlob,et al.  Complexity Results for Nonmonotonic Logics , 1992, J. Log. Comput..

[33]  Li-Yan Yuan,et al.  Logic Programs with Abstract Constraints: Representaton, Disjunction and Complexities , 2007, LPNMR.

[34]  Michael Gelfond,et al.  Classical negation in logic programs and disjunctive databases , 1991, New Generation Computing.

[35]  Jia-Huai You,et al.  Lparse Programs Revisited: Semantics and Representation of Aggregates , 2008, ICLP.

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