Semantics of Disjunctive Logic Programs and Deductive Databases

Recently the author introduced the so called stationary semantics which extends the well-founded semantics of normal logic programs to the class of all disjunctive logic programs and deductive databases. The stationary semantics also extends the perfect model semantics defined earlier for stratified disjunctive databases. As a result, the stationary semantics is the only currently known semantics which extends both semantics and is defined for all disjunctive databases.

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

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

[3]  David S. Touretzky,et al.  A Skeptical Theory of Inheritance in Nonmonotonic Semantic Networks , 1987, Artif. Intell..

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

[5]  Kenneth A. Ross,et al.  The well-founded semantics for general logic programs , 1991, JACM.

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

[7]  Teodor C. Przymusinski.  The Well-Founded Semantics Coincides with the Three-Valued Stable Semantics , 1990, Fundam. Inform..

[8]  Jack Minker,et al.  Logic and Data Bases , 1978, Springer US.

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

[10]  Jack Minker.  Foundations of deductive databases and logic programming , 1988 .

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

[12]  Teodor C. Przymusinski,et al.  On the Relationship Between Circumscription and Negation as Failure , 1989, Artif. Intell..

[13]  Vladimir Lifschitz,et al.  Computing Circumscription , 1985, IJCAI.

[14]  Alan van Gelser.  Negation as failure using tight derivations for general logic programs , 1989 .

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

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

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

[18]  John McCarthy,et al.  Circumscription - A Form of Non-Monotonic Reasoning , 1980, Artif. Intell..

[19]  Teodor C. Przymusinski.  Autoepistemic Logics of Closed Beliefs and Logic Programming , 1991, LPNMR.

[20]  Teodor C. Przymusinski.  Well-Founded Completions of Logic Programs , 1991, ICLP.

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

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

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

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