The Expressive Powers of the Logic Programming Semantics

Abstract We study the expressive of two semantics far deductive databases and logic programming: the well-founded semantics and the stable semantics. We compare them especially to two older semantics, the two-valued and three-valued program completion semantics. We identify the expressive power of the stable semantics and, in fairly general circumstances, that of the well-founded semantics. In particular, over infinite Herbrand universes, the four semantics all have the same expressive power. We discuss a feature of certain logic programming semantics, which we call the Principle of Stratification, a feature allowing a program to be built easily in modules. The three-valued program completion and well-founded semantics satisfy this principle. Over infinite Herbrand models, we consider a notion of translatability between the three-valued program completion and well-founded semantics which is in a sense uniform in the strata. In this sense of uniform translatability we show the well-founded semantics to be more expressive than the three-valued program completion. The proof is a corollary of our result that over non-Herbrand infinite models, the well-founded semantics is more expressive than the three-valued program completion semantics.

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

[2]  Peter Aczel,et al.  An Introduction to Inductive Definitions , 1977 .

[3]  Vladimir Lifschitz,et al.  On the Declarative Semantics of Logic Programs with Negation , 1987, Foundations of Deductive Databases and Logic Programming..

[4]  Victor W. Marek,et al.  How Complicated is the Set of Stable Models of a Recursive Logic Program? , 1992, Ann. Pure Appl. Log..

[5]  Yiannis N. Moschovakis,et al.  Elementary induction on abstract structures , 1974 .

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

[7]  David Harel,et al.  Horn Clauses Queries and Generalizations , 1985, J. Log. Program..

[8]  John C. Shepherdson,et al.  Negation in Logic Programming , 1988, Foundations of Deductive Databases and Logic Programming..

[9]  Kenneth Kunen,et al.  Negation in Logic Programming , 1987, J. Log. Program..

[10]  Melvin Fitting,et al.  A Kripke-Kleene Semantics for Logic Programs , 1985, J. Log. Program..

[11]  Christos H. Papadimitriou,et al.  Why not negation by fixpoint? , 1988, PODS '88.

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

[13]  Saharon Shelah,et al.  Fixed-point extensions of first-order logic , 1985, 26th Annual Symposium on Foundations of Computer Science (sfcs 1985).

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

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

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

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

[18]  Alfred V. Aho,et al.  Universality of data retrieval languages , 1979, POPL.

[19]  Jon Barwise,et al.  Admissible sets and structures , 1975 .

[20]  Krzysztof R. Apt,et al.  Arithmetic classification of perfect models of stratified programs , 1991, Fundam. Informaticae.

[21]  John C. Shepherdson,et al.  Negation as Failure II , 1985, J. Log. Program..

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

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

[24]  François Bry,et al.  Logic programming as constructivism: a formalization and its application to databases , 1989, PODS.

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

[26]  Neil Immerman,et al.  Relational Queries Computable in Polynomial Time , 1986, Inf. Control..

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

[28]  John S. Schlipf,et al.  Toward model theory through recursive saturation , 1978, Journal of Symbolic Logic.

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

[30]  John S. Schlipf,et al.  Decidability and definability with circumscription , 1987, Ann. Pure Appl. Log..

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

[32]  V. Lifschitz.  The mathematics of nonmonotonic reasoning , 1989, [1989] Proceedings. Fourth Annual Symposium on Logic in Computer Science.

[33]  K. Jon Barwise,et al.  An introduction to recursively saturated and resplendent models , 1976, Journal of Symbolic Logic.

[34]  Martin D. Davis,et al.  The Mathematics of Non-Monotonic Reasoning , 1980, Artif. Intell..

[35]  Allen Van Gelder,et al.  The Alternating Fixpoint of Logic Programs with Negation , 1993, J. Comput. Syst. Sci..

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

[37]  Kenneth Kunen,et al.  Some Remarks on the Completed Database , 1990, ICLP/SLP.