Non-determinism and weak constraints in Datalog

This paper introduces a simple and powerful extension of stratified DATALOG which permits to express various DB-complexity classes. The new language, called DATALOG¬s,c,p, extends DATALOG with stratified negation, a non-deterministic construct, calledchoice, and a weak form of constraints, calledpreference rules, that is, constraints that should be respected but, if they cannot be eventually enforced, they only invalidate the portions of the program which they are concerned with. Although DATALOG with stratified negation is not able to express all polynomial time queries,20) the introduction of the non-deterministic constructchoice permits to express, exactly, the ‘deterministic fragment’ of the class of DB-queriesP, under the non-deterministic semantics,NP, under the possible semantics, and coNP, under the certain semantics. The introduction of preference rules, further increases the expressive power of the language, and permits to express the complexity classes Σ2p, under the possibility semantics, and Π2p, under the certainty semantics.

[1]  Shamim A. Naqvi,et al.  Non-Deterministic Choice in Datalog , 1988, JCDKB.

[2]  Christos H. Papadimitriou,et al.  Why not Negation by Fixpoint? , 1991, J. Comput. Syst. Sci..

[3]  Sergio Greco,et al.  DATALOG Queries with Stratified Negation and Choice: from P to DP , 1995, ICDT.

[4]  Serge Abiteboul,et al.  Non-deterministic languages to express deterministic transformations , 1990, PODS '90.

[5]  Jeffrey D. Ullman,et al.  Principles Of Database And Knowledge-Base Systems , 1979 .

[6]  Divesh Srivastava,et al.  CORAL - Control, Relations and Logic , 1992, VLDB.

[7]  Serge Abiteboul,et al.  Datalog Extensions for Database Queries and Updates , 1991, J. Comput. Syst. Sci..

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

[9]  Shamim A. Naqvi,et al.  A Logical Language for Data and Knowledge Bases , 1989 .

[10]  Jia-Huai You,et al.  A Three-Valued Semantics for Deductive Databases and Logic Programs , 1994, J. Comput. Syst. Sci..

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

[12]  Sergio Greco,et al.  ``Possible is certain'' is desirable and can be expressive , 2004, Annals of Mathematics and Artificial Intelligence.

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

[14]  Georg Gottlob,et al.  Expressive Power and Complexity of Disjunctive Datalog under the Stable Model Semantics , 1994, IS/KI.

[15]  Serge Abiteboul,et al.  Foundations of Databases , 1994 .

[16]  Moshe Y. Vardi.  The complexity of relational query languages (Extended Abstract) , 1982, STOC '82.

[17]  Jeffrey D. Ullman,et al.  Principles of Database and Knowledge-Base Systems, Volume II , 1988, Principles of computer science series.

[18]  Phan Minh Dung,et al.  Negations as Hypotheses: An Abductive Foundation for Logic Programming , 1991, ICLP.

[19]  Phokion G. Kolaitis.  The Expressive Power of Stratified Programs , 1991, Inf. Comput..

[20]  Sergio Greco,et al.  Greedy by choice , 1992, PODS '92.

[21]  Mihalis Yannakakis,et al.  On Datalog vs. Polynomial Time , 1995, J. Comput. Syst. Sci..

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

[23]  Mihalis Yannakakis,et al.  On Datalog vs. polynomial time (extended abstract) , 1991, PODS '91.

[24]  Carlo Zaniolo,et al.  Non-Determinism in Deductive Databases , 1991, DOOD.

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

[26]  Neil Immerman,et al.  Languages that Capture Complexity Classes , 1987, SIAM J. Comput..

[27]  Carlo Zaniolo,et al.  Stable models and non-determinism in logic programs with negation , 1990, PODS.

[28]  Ronald Fagin.  Generalized first-order spectra, and polynomial. time recognizable sets , 1974 .

[29]  David Harel,et al.  Structure and Complexity of Relational Queries , 1980, FOCS.

[30]  David S. Johnson,et al.  A Catalog of Complexity Classes , 1991, Handbook of Theoretical Computer Science, Volume A: Algorithms and Complexity.

[31]  V. S. Subrahmanian,et al.  Stable and extension class theory for logic programs and default logics , 2006, Journal of Automated Reasoning.

[32]  John S. Schlipf,et al.  The Expressive Powers of the Logic Programming Semantics , 1995, J. Comput. Syst. Sci..

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

[34]  Domenico Saccà,et al.  The Expressive Powers of Stable Models for Bound and Unbound DATALOG Queries , 1997, J. Comput. Syst. Sci..

[35]  Paris C. Kanellakis,et al.  Elements of Relational Database Theory , 1991, Handbook of Theoretical Computer Science, Volume B: Formal Models and Sematics.