Nested expressions in logic programs

We extend the answer set semantics to a class of logic programs with nested expressions permitted in the bodies and heads of rules. These expressions are formed from literals using negation as failure, conjunction (,) and disjunction (;) that can be nested arbitrarily. Conditional expressions are introduced as abbreviations. The study of equivalent transformations of programs with nested expressions shows that any such program is equivalent to a set of disjunctive rules, possibly with negation as failure in the heads. The generalized answer set semantics is related to the Lloyd–Topor generalization of Clark’s completion and to the logic of minimal belief and negation as failure.

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

[2]  Vladimir Lifschitz,et al.  Action Languages, Answer Sets, and Planning , 1999, The Logic Programming Paradigm.

[3]  Vladimir Lifschitz.  Minimal Belief and Negation as Failure , 1994, Artif. Intell..

[4]  Leon Sterling,et al.  Relating Stable Models and AI Planning Domains , 1995 .

[5]  José Júlio Alferes,et al.  Dynamic Logic Programming , 1998, APPIA-GULP-PRODE.

[6]  V. Lifschitz,et al.  Foundations of Logic Programming , 1997 .

[7]  Chiaki Sakama,et al.  Negation as Failure in the Head , 1998, J. Log. Program..

[8]  C. A. R. Hoare.  Programs are predicates , 1984, Philosophical Transactions of the Royal Society of London. Series A, Mathematical and Physical Sciences.

[9]  Adrian Walker,et al.  Towards a Theory of Declarative Knowledge , 1988, Foundations of Deductive Databases and Logic Programming..

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

[11]  J. W. LLOYD,et al.  Making Prolog more Expressive , 1984, J. Log. Program..

[12]  Fangzhen Lin,et al.  A Logic of Knowledge and Justified Assumptions , 1992, Artif. Intell..

[13]  Non-Monotonic Extensions of Logic Programming , 1994, Lecture Notes in Computer Science.

[14]  Vladimir Lifschitz,et al.  Answer Sets in General Nonmonotonic Reasoning (Preliminary Report) , 1992, KR.

[15]  Gerd Wagner,et al.  Stable Models Are Generated by a Stabel Chain , 1997, J. Log. Program..

[16]  Victor W. Marek,et al.  Stable models and an alternative logic programming paradigm , 1998, The Logic Programming Paradigm.

[17]  Keith L. Clark,et al.  Negation as Failure , 1987, Logic and Data Bases.

[18]  Bernhard Nebel,et al.  Encoding Planning Problems in Nonmonotonic Logic Programs , 1997, ECP.

[19]  Gerald Pfeifer,et al.  The KR System dlv: Progress Report, Comparisons and Benchmarks , 1998, KR.

[20]  P. Simons.  Eecient Implementation of the Well- Founded and Stable Model Seman- Tics , 1996 .

[21]  Ilkka Niemelä,et al.  Efficient Implementation of the Well-founded and Stable Model Semantics , 1996, JICSLP.

[22]  Chiaki Sakama,et al.  On Positive Occurrences of Negation as Failure , 1994, KR.

[23]  Victor W. Marek,et al.  The Logic Programming Paradigm: A 25-Year Perspective , 2011 .