Why not Negation by Fixpoint?

Abstract There is a fixpoint semantics for DATALOG programs with negation that is a natural generalization of the standard semantics for DATALOG programs without negation. We show that, unfortunately, several compelling complexity-theoretic obstacles rule out its efficient implementation. As an alternative, we propose Inflationary DATALOG, an efficiently implementable cemantics for negation,based on inflationarv flxpoints.

[1]  Mihalis Yannakakis,et al.  A Note on Succinct Representations of Graphs , 1986, Inf. Control..

[2]  A. Tarski.  A LATTICE-THEORETICAL FIXPOINT THEOREM AND ITS APPLICATIONS , 1955 .

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

[4]  Jin-Yi Cai,et al.  The Boolean Hierarchy: Hardware over NP , 1986, SCT.

[5]  Elias Dahlhaus,et al.  Skolem Normal Forms Concerning the Least Fixpoint , 1987, Computation Theory and Logic.

[6]  Gerd Wechsung,et al.  On the Boolean closure of NP , 1985, FCT.

[7]  David S. Johnson,et al.  Some Simplified NP-Complete Graph Problems , 1976, Theor. Comput. Sci..

[8]  Krzysztof R. Apt,et al.  Contributions to the Theory of Logic Programming , 1982, JACM.

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

[10]  Serge Abiteboul,et al.  Procedural and declarative database update languages , 1988, PODS '88.

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

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

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

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

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

[16]  Phokion G. Kolaitis.  Implicit definability on finite structures and unambiguous computations , 1990, [1990] Proceedings. Fifth Annual IEEE Symposium on Logic in Computer Science.

[17]  Jim Kadin.  The polynomial time hierarchy collapses if the Boolean hierarchy collapses , 1988, [1988] Proceedings. Structure in Complexity Theory Third Annual Conference.

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

[19]  Mihalis Yannakakis,et al.  The complexity of facets (and some facets of complexity) , 1982, STOC '82.

[20]  Andreas Blass,et al.  On the Unique Satisfiability Problem , 1982, Inf. Control..

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

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