Semantics for Disjunctive Logic Programs with Explicit and Default Negation

The use of explicit negation enhances the expressive power of logic programs by providing a natural and unambiguous way to assert negated information about the domain being represented. We study the semantics of disjunctive programs that contain both explicit negation and negation-by-default, called extended disjunctive logic programs. General techniques are described for extending model, fixpoint, and proof theoretic characterizations of an arbitrary semantics of normal disjunctive logic programs to cover the class of extended programs. Illustrations of these techniques are given for stable models, disjunctive well-founded and stationary semantics. The declarative complexity of the extended programs, as well as the algorithmic complexity of the proof procedures and fixpoint operators, are discussed.

[1]  Joseph R. Shoenfield,et al.  Mathematical logic , 1967 .

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

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

[4]  Raymond Reiter.  On Closed World Data Bases , 1977, Logic and Data Bases.

[5]  David Harel,et al.  Structure and complexity of relational queries , 1980, 21st Annual Symposium on Foundations of Computer Science (sfcs 1980).

[6]  Jack Minker,et al.  An Extension to Linear Resolution with Selection Function , 1982, Inf. Process. Lett..

[7]  Jack Minker,et al.  On Indefinite Databases and the Closed World Assumption , 1987, CADE.

[8]  J. Lloyd.  Foundations of Logic Programming , 1984, Symbolic Computation.

[9]  Michael Gelfond,et al.  On Stratified Autoepistemic Theories , 1987, AAAI.

[10]  J. W. Lloyd,et al.  Foundations of logic programming; (2nd extended ed.) , 1987 .

[11]  Jack Minker,et al.  Procedural Interpretation of Non-Horn Logic Programs , 1988, CADE.

[12]  David Chan,et al.  Constructive Negation Based on the Completed Database , 1988, ICLP/SLP.

[13]  V. Lifschitz,et al.  The Stable Model Semantics for Logic Programming , 1988, ICLP/SLP.

[14]  Allen Van Gelder,et al.  Negation as Failure using Tight Derivations for General Logic Programs , 1988, J. Log. Program..

[15]  Kenneth A. Ross,et al.  Unfounded sets and well-founded semantics for general logic programs , 1988, PODS.

[16]  Teodor C. Przymusinski.  On the Declarative Semantics of Deductive Databases and Logic Programs , 1988, Foundations of Deductive Databases and Logic Programming..

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

[18]  Teodor C. Przymusinski.  Perfect Model Semantics , 1988, ICLP/SLP.

[19]  Kenneth A. Ross,et al.  The Well Founded Semantics for Disjunctive Logic Programs , 1989, DOOD.

[20]  Jorge Lobo,et al.  Extending the Semantics of Logic Programs to Disjunctive Logic Programs , 1989, ICLP.

[21]  Gerd Wagner,et al.  Logic Programming with Strong Negation , 1989, ELP.

[22]  Teodor C. Przymusinski.  Every logic program has a natural stratification and an iterated least fixed point model , 1989, PODS.

[23]  Kenneth A. Ross,et al.  A procedural semantics for well founded negation in logic programs , 1989, J. Log. Program..

[24]  Teodor C. Przymusinski.  Stationary Semantics for Disjunctive Logic Programs and Deductive Databases , 1990, NACLP.

[25]  Michael Gelfond,et al.  Logic Programs with Classical Negation , 1990, ICLP.

[26]  Jorge Lobo,et al.  Generalized Well-founded Semantics for Logic Programs (Extended Abstract) , 1990, CADE.

[27]  Teodor C. Przymusinski.  Extended Stable Semantics for Normal and Disjunctive Programs , 1990, ICLP.

[28]  J. Minker,et al.  Semantics for normal disjunctive logic programs , 1990 .

[29]  Jack Minker,et al.  A Fixpoint Semantics for Disjunctive Logic Programs , 1990, J. Log. Program..

[30]  Jorge Lobo,et al.  WF³: A Semantics for Negation in Normal Disjunctive Logic Programs , 1991, ISMIS.

[31]  David W. Reed,et al.  An Alternative Characterization of Disjunctive Logic Programs , 1991, ISLP.

[32]  Victor W. Marek,et al.  Computing Intersection of Autoepistemic Expansions , 1991, LPNMR.

[33]  Gerd Wagner,et al.  A Database Needs Two Kinds of Negation , 1991, MFDBS.

[34]  Victor W. Marek,et al.  Autoepistemic logic , 1991, JACM.

[35]  José Júlio Alferes,et al.  On Logic Program Semantics with Two Kinds of Negation , 1992, JICSLP.

[36]  Katsumi Inoue,et al.  Embedding Negation as Failure into a Model Generation Theorem Prover , 1992, CADE.

[37]  Jorge Lobo,et al.  Foundations of disjunctive logic programming , 1992, Logic Programming.

[38]  Chitta Baral.  Issues in knowledge representation: semantics and knowledge combination , 1992 .

[39]  John S. Schlipf.  A Survey of Complexity and Undecidability Results in Logic Programming , 1992, Structural Complexity and Recursion-theoretic methods in Logic-Programming.

[40]  Carolina Ruiz,et al.  On Extended Disjunctive Logic Programs , 1993, ISMIS.

[41]  Victor W. Marek,et al.  The Stable Models of a Predicate Logic Program , 1994, J. Log. Program..