Complexity and expressive power of logic programming

This article surveys various complexity and expressiveness results on different forms of logic programming. The main focus is on decidable forms of logic programming, in particular, propositional logic programming and datalog, but we also mention general logic programming with function symbols. Next to classical results on plain logic programming (pure Horn clause programs), more recent results on various important extensions of logic programming are surveyed. These include logic programming with different forms of negation, disjunctive logic programming, logic programming with equality, and constraint logic programming.

[1]  Michael Benedikt,et al.  Languages for relational databases over interpreted structures , 1997, PODS '97.

[2]  Chiaki Sakama,et al.  Negation as Failure in the Head , 1998, J. Log. Program..

[3]  Helmut Veith.  Succinct Representation and Leaf Languages , 1995, Electron. Colloquium Comput. Complex..

[4]  Steffen Hölldobler,et al.  Foundations of Equational Logic Programming , 1989, Lecture Notes in Computer Science.

[5]  Paliath Narendran,et al.  Complexity of Matching Problems , 1987, J. Symb. Comput..

[6]  Phokion G. Kolaitis,et al.  On the expressive power of datalog: tools and a case study , 1990, J. Comput. Syst. Sci..

[7]  V. S. Subrahmanian,et al.  A firstdorder representation of stable models[1]A preliminary version of this paper has appeared inc Proc. 4th International Conference on Logic Programming and Nonmonotonic Reasoning (LPNMR ’97), J. Dix, U. Furbach and A. Nerode, eds, LNCS 1265, Springer, 1997. , 1998 .

[8]  Jack Minker,et al.  On recursive axioms in deductive databases , 1983, Inf. Syst..

[9]  Harry G. Mairson,et al.  Undecidable optimization problems for database logic programs , 1993, JACM.

[10]  Dino Pedreschi,et al.  Datalog with Non-Deterministic Choice Computes NDB-PTIME , 1993, DOOD.

[11]  Georg Gottlob,et al.  Adding disjunction to datalog (extended abstract) , 1994, PODS.

[12]  Jan Van den Bussche,et al.  First-Order Queries on Finite Structures Over the Reals , 1998, SIAM J. Comput..

[13]  V. S. Subrahmanian,et al.  A First-Order Representation of Stable Models , 1998, AI Commun..

[14]  Dan Suciu,et al.  Bounded Fixpoints for Complex Objects , 1993, Theor. Comput. Sci..

[15]  Luigi Palopoli,et al.  Circumscribing DATALOG: Expressive Power and Complexity , 1998, Theor. Comput. Sci..

[16]  Mike Paterson,et al.  Linear unification , 1976, STOC '76.

[17]  Jianwen Su,et al.  Linear Constraint Query Languages: Expressive Power and Complexity , 1994, LCC.

[18]  Jörg Würtz,et al.  Smallest Horn Clause Programs , 1996, J. Log. Program..

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

[20]  Georg Gottlob,et al.  Complexity of Propositional Knowledge Base Revision , 1992, CNKBS.

[21]  Thomas Eiter,et al.  Preferred Answer Sets for Extended Logic Programs , 1999, Artif. Intell..

[22]  Richard M. Karp,et al.  Complexity of Computation , 1974 .

[23]  Georg Gottlob,et al.  Complexity and expressive power of logic programming , 1997, Proceedings of Computational Complexity. Twelfth Annual IEEE Conference.

[24]  Georg Gottlob,et al.  Linear time datalog and branching time logic , 2000 .

[25]  Mihalis Yannakakis,et al.  Algorithms for Acyclic Database Schemes , 1981, VLDB.

[26]  Richard Statman,et al.  Unifiability is Complete for co-NLogSpace , 1982, Inf. Process. Lett..

[27]  Francesco Buccafurri,et al.  Disjunctive Ordered Logic: Semantics and Expressiveness , 1998, KR.

[28]  Jürgen Dix,et al.  Disjunctive Semantics based upon Partial and Bottom-Up Evaluation , 1995, ICLP.

[29]  Georg Gottlob,et al.  Expressiveness of Stable Model Semantics for Disjuncitve Logic Programs with Functions , 1997, J. Log. Program..

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

[31]  Yehoshua Sagiv.  On computing restricted projections of representative instances , 1985, PODS '85.

[32]  Robert A. Kowalski,et al.  Predicate Logic as Programming Language , 1974, IFIP Congress.

[33]  Vladimir Yu. Sazonov,et al.  Hereditarily-Finite Sets, Data Bases and Polynomial-Time Computability , 1993, Theor. Comput. Sci..

[34]  Matthias Jarke,et al.  Logic Programming and Databases , 1984, Expert Database Workshop.

[35]  Neil Immerman,et al.  Descriptive Complexity , 1999, Graduate Texts in Computer Science.

[36]  A. Wilkie.  THE CLASSICAL DECISION PROBLEM (Perspectives in Mathematical Logic) By Egon Börger, Erich Grädel and Yuri Gurevich: 482 pp., DM.158.–, ISBN 3 540 57073 X (Springer, 1997). , 1998 .

[37]  Leonard Berman,et al.  The Complexity of Logical Theories , 1980, Theor. Comput. Sci..

[38]  Ashok K. Chandra,et al.  Optimal implementation of conjunctive queries in relational data bases , 1977, STOC '77.

[39]  Anthony J. Bonner.  Hypothetical Datalog: Complexity and Expressibility , 1990, Theor. Comput. Sci..

[40]  Jerzy Marcinkowski.  The 3 Frenchmen Method Proves Undecidability of the Uniform Boundedness for Single Recursive Rule Ternary DATALOG Programs , 1996, STACS.

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

[42]  Howard A. Blair,et al.  The Complexity of Local Stratification , 1994, Fundam. Informaticae.

[43]  Christine Froidevaux,et al.  Negation by Default and Unstratifiable Logic Programs , 1991, Theor. Comput. Sci..

[44]  Limsoon Wong,et al.  New techniques for studying set languages, bag languages and aggregate functions , 1994, PODS '94.

[45]  Ehud Y. Shapiro.  Alternation and the Computational Complexity of Logic Programs , 1984, J. Log. Program..

[46]  Georg Gottlob,et al.  Hypertree decompositions and tractable queries , 1998, J. Comput. Syst. Sci..

[47]  Jeffrey F. Naughton,et al.  A Simple Characterization of Uniform Boundedness for a Class of Recursions , 1991, J. Log. Program..

[48]  Jeffrey B. Remmel,et al.  Non-Monotonic Reasoning with Quantified Boolean Constraints , 1997, LPNMR.

[49]  Jean H. Gallier,et al.  SLD-Resolution Methods for Horn Clauses with Equality Based on E-Unification , 1986, SLP.

[50]  Edward P. F. Chan.  A Possible World Semantics for Disjunctive Databases , 1993, IEEE Trans. Knowl. Data Eng..

[51]  Georg Gottlob,et al.  Fast Subsumption Algorithms , 1985, European Conference on Computer Algebra.

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

[53]  David A. McAllester.  Automatic recognition of tractability in inference relations , 1993, JACM.

[54]  Dima Grigoriev,et al.  Solving Systems of Polynomial Inequalities in Subexponential Time , 1988, J. Symb. Comput..

[55]  Alon Itai,et al.  Unification as a Complexity Measure for Logic Programming , 1987, J. Log. Program..

[56]  Phokion G. Kolaitis,et al.  Database Theory — ICDT '97 , 1997, Lecture Notes in Computer Science.

[57]  Jerzy Marcinkowski,et al.  Achilles, Turtle, and Undecidable Boundedness Problems for Small DATALOG Programs , 1999, SIAM J. Comput..

[58]  John S. Schlipf,et al.  Affordable Classes of Normal Logic Programs , 1997, LPNMR.

[59]  Thomas Eiter,et al.  The Expressive Power of Partial Models in Disjunctive Deductive Databases , 1996, Logic in Databases.

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

[61]  Harry R. Lewis,et al.  Unsolvable classes of quantificational formulas , 1979 .

[62]  Georg Gottlob,et al.  The complexity of logic-based abduction , 1993, JACM.

[63]  Georg Gottlob,et al.  Removing Redundancy from a Clause , 1993, Artif. Intell..

[64]  Melvin Fitting.  Enumeration Operators and Modular Logic Programming , 1987, J. Log. Program..

[65]  Journal of the Association for Computing Machinery , 1961, Nature.

[66]  Georg Gottlob,et al.  Propositional Circumscription and Extended Closed-World Reasoning are IIp2-Complete , 1993, Theor. Comput. Sci..

[67]  Jan Van den Bussche,et al.  First-Order Queries on Databases Embedded in an Infinite Structure , 1996, Inf. Process. Lett..

[68]  Yehoshua Sagiv,et al.  Optimizing datalog programs , 1987, Foundations of Deductive Databases and Logic Programming..

[69]  Georg Gottlob,et al.  Modular Logic Programming and Generalized Quantifiers , 1997, LPNMR.

[70]  Chiaki Sakama,et al.  On the Equivalence between Disjunctive and Abductive Logic Programs , 1994, ICLP.

[71]  Walter J. Savitch,et al.  Relationships Between Nondeterministic and Deterministic Tape Complexities , 1970, J. Comput. Syst. Sci..

[72]  Limsoon Wong,et al.  Local properties of query languages , 1997, Theor. Comput. Sci..

[73]  Georg Gottlob,et al.  On the Complexity of Single-Rule Datalog Queries , 1999, LPAR.

[74]  Serge Abiteboul,et al.  Fixpoint logics, relational machines, and computational complexity , 1997, JACM.

[75]  Leonard Berman,et al.  Precise bounds for presburger arithmetic and the reals with addition: Preliminary report , 1977, 18th Annual Symposium on Foundations of Computer Science (sfcs 1977).

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

[77]  Kumar V. Vadaparty.  On the power of rule-based languages with sets , 1991, PODS '91.

[78]  Jack Minker,et al.  Circumscription and Disjunctive Logic Programming , 1991, Artificial and Mathematical Theory of Computation.

[79]  Ju. V. Matijasevic,et al.  ENUMERABLE SETS ARE DIOPHANTINE , 2003 .

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

[81]  Thomas Eiter,et al.  Querying Disjunctive Databases Through Nonmonotonic Logics , 1996, Theor. Comput. Sci..

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

[83]  Jack Minker,et al.  Logic and Databases: A 20 Year Retrospective , 1996, Logic in Databases.

[84]  Jeffrey F. Naughton,et al.  A decidable class of bounded recursions , 1987, PODS '87.

[85]  Jörg Flum,et al.  Finite model theory , 1995, Perspectives in Mathematical Logic.

[86]  Johann A. Makowsky,et al.  Embedded implicational dependencies and their inference problem , 1981, STOC '81.

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

[88]  Sergio Greco,et al.  The Expressive Power of "Possible-is-Certain" Semantics (Extended Abstract) , 1996, ASIAN.

[89]  Jörg Flum,et al.  Total and Partial Well-Founded Datalog Coincide , 1997, ICDT.

[90]  Dino Pedreschi,et al.  Datalog with Non-Deterministic Choice Computers NDB-PTIME , 1998, J. Log. Program..

[91]  Serge Abiteboul,et al.  Generic Computation and its complexity , 1991, STOC '91.

[92]  Dan Suciu,et al.  The Restricted and Bounded Fixpoint Closures of the Nested Relational Algebra are Equivalent , 1995, DBPL.

[93]  Sten-Åke Tärnlund,et al.  Horn clause computability , 1977, BIT.

[94]  Kenneth McAloon,et al.  Decision Procedures for Constraint Based Extensions of Datalog , 1993, WCLP.

[95]  Philippe Devienne.  Weighted Graphs: A Tool for Studying the Halting Problem and Time Complexity in Term Rewriting Systems and Logic Programming , 1990, Theor. Comput. Sci..

[96]  S. Abiteboul,et al.  Fixpoint extensions of first-order logic and datalog-like languages , 1989, [1989] Proceedings. Fourth Annual Symposium on Logic in Computer Science.

[97]  Marc Gyssens,et al.  On Query Languages for Linear Queries Definable with Polynomial Constraints , 1996, CP.

[98]  Paris C. Kanellakis,et al.  Logic Programming and Parallel Complexity , 1986, Foundations of Deductive Databases and Logic Programming..

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

[100]  Sergio Greco,et al.  Deterministic Semantics for Datalog¬: Complexity and Expressive Power , 1997, DOOD.

[101]  Miroslaw Truszczynski,et al.  On the problem of computing the well-founded semantics , 2001, Theory Pract. Log. Program..

[102]  Egon Börger,et al.  Decision Problems in Predicate Logic , 1984 .

[103]  C. R. Ramakrishnan,et al.  Subsumption Algorithms Based on Search Trees , 1996, CAAP.

[104]  Serge Abiteboul,et al.  COL: A Logic-Based Language for Complex Objects , 1988, EDBT.

[105]  Alexander Leitsch.  Deciding Horn Classes by Hyperresolution , 1989, CSL.

[106]  Marco Schaerf,et al.  A Survey of Complexity Results for Nonmonotonic Logics , 1993, J. Log. Program..

[107]  Moshe Y. Vardi.  On the complexity of bounded-variable queries (extended abstract) , 1995, PODS '95.

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

[109]  Georg Gottlob,et al.  A Non-Ground Realization of the Stable and Well-Founded Semantics , 1996, Theor. Comput. Sci..

[110]  Daniel Leivant,et al.  Descriptive Characterizations of Computational Complexity , 1989, J. Comput. Syst. Sci..

[111]  Michael Hanus,et al.  The Integration of Functions into Logic Programming: From Theory to Practice , 1994, J. Log. Program..

[112]  José L. Balcázar,et al.  Structural Complexity II , 2012, EATCS.

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

[114]  EiterThomas,et al.  The complexity of logic-based abduction , 1995 .

[115]  J. R. Büchi.  Turing-machines and the Entscheidungsproblem , 1962 .

[116]  Christos H. Papadimitriou,et al.  A note the expressive power of Prolog , 1985, Bull. EATCS.

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

[118]  Georg Gottlob,et al.  Datalog LITE: a deductive query language with linear time model checking , 2002, TOCL.

[119]  Paliath Narendran,et al.  NP-Completeness of the Set Unification and Matching Problems , 1986, CADE.

[120]  Foto N. Afrati,et al.  On the Expressiveness of First-Order Constraint Languages , 1995, CDB.

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

[122]  Jean H. Gallier,et al.  Linear-Time Algorithms for Testing the Satisfiability of Propositional Horn Formulae , 1984, J. Log. Program..

[123]  Laks V. S. Lakshmanan,et al.  Inductive pebble games and the expressive power of datalog , 1989, PODS '89.

[124]  Jan van Leeuwen,et al.  Handbook of Theoretical Computer Science, Vol. B: Formal Models and Semantics , 1994 .

[125]  Jean H. Gallier,et al.  Extending SLD Resolution to Equational Horn Clauses using E-Unification , 1989, J. Log. Program..

[126]  Michael Benedikt,et al.  On the structure of queries in constraint query languages , 1996, Proceedings 11th Annual IEEE Symposium on Logic in Computer Science.

[127]  Martin Davis,et al.  The Undecidable: Basic Papers on Undecidable Propositions, Unsolvable Problems and Computable Functions , 2004 .

[128]  Neil D. Jones,et al.  Complete problems for deterministic polynomial time , 1974, STOC '74.

[129]  Evgeny Dantsin,et al.  Expressive Power and Data Complexity of Query Languages for Trees and Lists , 2000, PODS 2000.

[130]  Victor Vianu,et al.  Tractable query languages for complex object databases , 1991, PODS '91.

[131]  Dina Q. Goldin,et al.  Constraint Programming and Database Query Languages , 1994, TACS.

[132]  Riccardo Rosati.  Expressiveness vs. Complexity in Nonmonotonic Knowledge Bases: Propositional Case , 1998, ECAI.

[133]  Chitta Baral,et al.  Logic Programming and Knowledge Representation , 1994, J. Log. Program..

[134]  Michael J. Maher,et al.  Constraint Logic Programming: A Survey , 1994, J. Log. Program..

[135]  Dirk Van Gucht,et al.  Converting nested algebra expressions into flat algebra expressions , 1992, TODS.

[136]  Georg Gottlob,et al.  On the Indiscernibility of Individuals in Logic Programming , 1997, Journal of Logic and Computation.

[137]  Jeffrey D. Uuman.  Principles of database and knowledge- base systems , 1989 .

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

[139]  Luca Cabibbo,et al.  The Expressive Power of Stratified Logic Programs with Value Invention , 1998, Inf. Comput..

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

[141]  Mihalis Yannakakis,et al.  Equivalences Among Relational Expressions with the Union and Difference Operators , 1980, J. ACM.

[142]  Foto N. Afrati,et al.  Expressiveness of restricted recursive queries , 1989, STOC '89.

[143]  Jeffrey F. Naughton.  Data Independent Recursion in Deductive Databases , 1989, J. Comput. Syst. Sci..

[144]  Neil D. Jones,et al.  Complete problems for deterministic polynomial time , 1974, Symposium on the Theory of Computing.

[145]  Robert A. Kowalski,et al.  Linear Resolution with Selection Function , 1971, Artif. Intell..

[146]  Erich Grädel,et al.  Capturing Complexity Classes by Fragments of Second-Order Logic , 1991, Theor. Comput. Sci..

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

[148]  Victor W. Marek,et al.  On the complexity of abduction , 1996, Proceedings 11th Annual IEEE Symposium on Logic in Computer Science.

[149]  Moshe Y. Vardi.  Decidability and undecidability results for boundedness of linear recursive queries , 1988, PODS.

[150]  Georg Gottlob,et al.  Subsumption and Implication , 1987, Inf. Process. Lett..

[151]  Limsoon Wong,et al.  Principles of Programming with Complex Objects and Collection Types , 1995, Theor. Comput. Sci..

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

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

[154]  José L. Balcázar,et al.  Structural complexity 2 , 1990 .

[155]  Evgeny Dantsin,et al.  Complexity of Query Answering in Logic Databases with Complex Values , 1998 .

[156]  Hiroto Yasuura,et al.  On Parallel Computational Complexity of Unification , 1984, Fifth Generation Computer Systems.

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

[158]  Luigi Palopoli,et al.  On the Complexity of Search Queries , 1998, FMLDO.

[159]  Zsuzsanna Markusz,et al.  A Design Methodology in Prolog Programming , 1982, ICLP.

[160]  Georg Gottlob,et al.  Working with arms: Complexity results on atomic representations of Herbrand models , 1999, Proceedings. 14th Symposium on Logic in Computer Science (Cat. No. PR00158).

[161]  Franz Baader,et al.  Unification in the Union of Disjoint Equational Theories: Combining Decision Procedures , 1992, CADE.

[162]  Sergio Greco,et al.  The Expressive Power of Unique Total Stable Model Semantics , 1997, ICALP.

[163]  Nicole Bidoit,et al.  Negation in Rule-Based Database Languages: A Survey , 1991, Theor. Comput. Sci..

[164]  Giorgio Levi,et al.  Declarative Modeling of the Operational Behavior of Logic Languages , 1989, Theor. Comput. Sci..

[165]  共立出版株式会社.  コンピュータ・サイエンス : ACM computing surveys , 1978 .

[166]  Anatoli Degtyarev,et al.  A Note on Semantics of Logic Programs with Equality Based on Complete Sets of E-Unifiers , 1996, J. Log. Program..

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

[168]  Paliath Narendran,et al.  Some Results on Equational Unification , 1990, CADE.

[169]  Phokion G. Kolaitis,et al.  Fixpoint logic vs. infinitary logic in finite-model theory , 1992, [1992] Proceedings of the Seventh Annual IEEE Symposium on Logic in Computer Science.

[170]  Alexander Leitsch,et al.  The Resolution Calculus , 1997, Texts in Theoretical Computer Science An EATCS Series.

[171]  Limsoon Wong,et al.  On Representation and Querying Incomplete Information in Databases with Bags , 1995, Inf. Process. Lett..

[172]  Latha S. Colby,et al.  Tractable Iteration Mechanisms for Bag Languages , 1997, ICDT.

[173]  Georg Gottlob,et al.  Disjunctive datalog , 1997, TODS.

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

[175]  H. Scholz,et al.  Grundzüge der mathematischen Logik , 1961 .

[176]  Andrei Voronkov,et al.  Complexity of nonrecursive logic programs with complex values , 1998, PODS.

[177]  Mihalis Yannakakis,et al.  On the complexity of database queries (extended abstract) , 1997, PODS.

[178]  Petr Stepánek,et al.  Transformations of Logic Programs , 1984, J. Log. Program..

[179]  Michael J. Maher,et al.  Foundations of Deductive Databases and Logic Programming , 1988 .

[180]  Jörg Würtz,et al.  Satisfiability of the Smallest Binary Program , 1993, Inf. Process. Lett..

[181]  Jianwen Su,et al.  First-order Definability over Constraint Databases , 1995, CP.

[182]  J. Marcinkowski.  DATALOG SIRUPs uniform boundedness is undecidable , 1996, Proceedings 11th Annual IEEE Symposium on Logic in Computer Science.

[183]  Surajit Chaudhuri,et al.  On the Equivalence of Recursive and Nonrecursive Datalog Programs , 1997, J. Comput. Syst. Sci..

[184]  Leszek Pacholski,et al.  Complexity of Makanin's algorithm , 1996, JACM.

[185]  Foto N. Afrati,et al.  Bonded arity Datalog (≠) queries on graphs , 1994, PODS '94.

[186]  Melvin Fitting,et al.  Computability theory, semantics, and logic programming , 1987 .

[187]  autoepistemic Zogic.  Logic programming and negation : a survey , 2001 .

[188]  Surajit Chaudhuri,et al.  On the complexity of equivalence between recursive and nonrecursive Datalog programs , 1994, PODS '94.

[189]  John S. Schlipf,et al.  Computing Well-founded Semantics Faster , 1995, LPNMR.

[190]  Yuri Gurevich,et al.  Datalog vs First-Order Logic , 1994, J. Comput. Syst. Sci..

[191]  Francesco Scarcello,et al.  Disjunctive Stable Models: Unfounded Sets, Fixpoint Semantics, and Computation , 1997, Inf. Comput..

[192]  Limsoon Wong,et al.  Local properties of query languages , 2000, Theor. Comput. Sci..

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

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

[195]  Georg Gottlob,et al.  Generalized Quantifiers in Logic Programs , 1997, ESSLLI.

[196]  Leonid Libkin.  On the forms of locality over finite models , 1997, Proceedings of Twelfth Annual IEEE Symposium on Logic in Computer Science.

[197]  Gabriel M. Kuper,et al.  Constraint query languages (preliminary report) , 1990, PODS '90.

[198]  Cynthia Dwork,et al.  Parallel Algorithms for Term Matching , 1988, SIAM J. Comput..

[199]  Surajit Chaudhuri,et al.  On the equivalence of recursive and nonrecursive datalog programs , 1992, J. Comput. Syst. Sci..

[200]  Stavros S. Cosmadakis.  On the first-order expressibility of recursive queries , 1989, PODS '89.

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

[202]  Oded Shmueli,et al.  Decidability and expressiveness aspects of logic queries , 1987, XP7.52 Workshop on Database Theory.

[203]  Serge Abiteboul.  Boundedness is Undecidable for Datalog Programs with a Single Recursive Rule , 1989, Inf. Process. Lett..

[204]  R. Smullyan.  Theory of formal systems , 1962 .

[205]  José L. Balcázar,et al.  The complexity of algorithmic problems on succinct instances , 1992 .

[206]  J. van Leeuwen,et al.  Logic Programming , 2002, Lecture Notes in Computer Science.

[207]  Georg Gottlob,et al.  Succinctness as a Source of Complexity in Logical Formalisms , 1999, Ann. Pure Appl. Log..

[208]  Foto N. Afrati,et al.  Bounded Arity Datalog (not-)Queries on Graphs , 1997, J. Comput. Syst. Sci..

[209]  Christos H. Papadimitriou,et al.  The parallel complexity of simple logic programs , 1993, JACM.

[210]  A. Dawar.  FINITE MODEL THEORY (Perspectives in Mathematical Logic) , 1997 .

[211]  John W. Lloyd,et al.  Foundations of Logic Programming, 1st Edition , 1984 .

[212]  Franz Baader,et al.  Unification theory , 1986, Decis. Support Syst..

[213]  Michael J. Maher.  Equivalences of Logic Programs , 1988, Foundations of Deductive Databases and Logic Programming..

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

[215]  Evgeny Dantsin,et al.  Expressive power and data complexity of nonrecursive query languages for lists and trees (extended abstract) , 2000, PODS '00.

[216]  John F. Canny,et al.  Some algebraic and geometric computations in PSPACE , 1988, STOC '88.

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

[218]  Leszek Pacholski,et al.  Undecidability of the Horn-clause implication problem , 1992, Proceedings., 33rd Annual Symposium on Foundations of Computer Science.

[219]  Luigi Palopoli,et al.  Testing Logic Programs for Local Stratification , 1992, Theor. Comput. Sci..

[220]  Georg Gottlob,et al.  Second Order Logic and the Weak Exponential Hierarchies , 1995, MFCS.

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

[222]  Alberto Martelli,et al.  Unification in linear time and space: a structured presentation , 1976 .

[223]  Georg Gottlob,et al.  Abduction from Logic Programs: Semantics and Complexity , 1997, Theor. Comput. Sci..

[224]  Georg Gottlob,et al.  On the efficiency of subsumption algorithms , 1985, JACM.

[225]  Doug Ierardi,et al.  Quantifier elimination in the theory of an algebraically-closed field , 1989, STOC '89.

[226]  Alexei Lisitsa,et al.  Delta-Languages for Sets and sub-PTIME Graphs Transformers , 1995, ICDT.

[227]  Wolfgang Thomas,et al.  Handbook of Theoretical Computer Science, Volume B: Formal Models and Semantics , 1990 .

[228]  Riccardo Rosati.  Reasoning with Minimal Belief and Negation as Failure: Algorithms and Complexity , 1997, AAAI/IAAI.

[229]  Miroslaw Truszczynski,et al.  On the Problem of Computing the Well-Founded Semantics , 2000, Computational Logic.

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

[231]  Jan Chomicki,et al.  Generalized Closed World Assumptions is Pi^0_2-Complete , 1990, Inf. Process. Lett..

[232]  Ron van der Meyden,et al.  The complexity of querying indefinite data about linearly ordered domains , 1992, J. Comput. Syst. Sci..

[233]  Sergey M. Dudakov.  On the Complexity of Perfect Models of Logic Programs , 1999, Fundam. Informaticae.

[234]  Limsoon Wong,et al.  Normal Forms and Conservative Extension Properties for Query Languages over Collection Types , 1996, J. Comput. Syst. Sci..

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

[236]  Philippe Devienne,et al.  Halting Problem of One Binary Horn Clause is Undecidable , 1993, STACS.

[237]  Sergio Greco,et al.  Extending Datalog with Arrays , 1995, Data Knowl. Eng..

[238]  James Renegar,et al.  A faster PSPACE algorithm for deciding the existential theory of the reals , 1988, [Proceedings 1988] 29th Annual Symposium on Foundations of Computer Science.

[239]  Alexandre Ja. Dikovsky.  On the Computational Complexity of Prolog Programs , 1993, Theor. Comput. Sci..

[240]  John C. Mitchell,et al.  On the Sequential Nature of Unification , 1984, J. Log. Program..

[241]  Jürgen Dix,et al.  Reducing Disjunctive to Non-Disjunctive Semantics by Shift-Operations , 1996, Fundam. Informaticae.

[242]  Jeffrey D. Ullman,et al.  Parallel complexity of logical query programs , 1986, 27th Annual Symposium on Foundations of Computer Science (sfcs 1986).

[243]  D. V. Gucht,et al.  First-order queries on finite structures over the reals , 1995, Proceedings of Tenth Annual IEEE Symposium on Logic in Computer Science.

[244]  Robert Givan,et al.  Polynomial-time computation via local inference relations , 2000, TOCL.

[245]  A. Turing.  On Computable Numbers, with an Application to the Entscheidungsproblem. , 1937 .

[246]  Evgeny Dantsin,et al.  A Nondeterministic Polynomial-Time Unification Algorithm for Bags, Sets and Trees , 1999, FoSSaCS.

[247]  C. Cordell Green,et al.  The Application of Theorem Proving to Question-Answering Systems , 1969, Outstanding Dissertations in the Computer Sciences.

[248]  Serge Abiteboul,et al.  Object identity as a query language primitive , 1989, SIGMOD '89.

[249]  Francesco Buccafurri,et al.  Enhancing Disjunctive Datalog by Constraints , 2000, IEEE Trans. Knowl. Data Eng..

[250]  Michael Kifer,et al.  Logical foundations of object-oriented and frame-based languages , 1995, JACM.

[251]  Francesca Rossi,et al.  Principles and Practice of Constraint Programming — CP '95 , 1995, Lecture Notes in Computer Science.

[252]  Helmut Veith.  Succinct Representation, Leaf Languages, and Projection Reductions , 1998, Inf. Comput..

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

[254]  Anthony J. Bonner.  Intuitionistic Deductive Databases and the Polynomial Time Hierarchy , 1997, J. Log. Program..

[255]  Petr Stepánek,et al.  Logic Programs and Alternation , 1986, ICLP.

[256]  G. Makanin.  The Problem of Solvability of Equations in a Free Semigroup , 1977 .

[257]  Yuri Gurevich,et al.  The Classical Decision Problem , 1997, Perspectives in Mathematical Logic.

[258]  Hajnal Andréka,et al.  The generalized completeness of Horn predicate-logic as a programming language , 1978, Acta Cybern..

[259]  Mihalis Yannakakis,et al.  On the Complexity of Database Queries , 1999, J. Comput. Syst. Sci..

[260]  Georg Gottlob,et al.  Complexity Results for Abductive Logic Programming , 1995, LPNMR.

[261]  Howard A. Blair,et al.  The Recursion-Theoretical Complexity of the Semantics of Predicate Logic as a Programming Language , 1982, Inf. Control..

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

[263]  Saso Dzeroski,et al.  Inductive logic programming and learnability , 1994, SGAR.

[264]  Alberto Martelli,et al.  An Efficient Unification Algorithm , 1982, TOPL.

[265]  José Júlio Alferes,et al.  Belief Revision in Non-Monotonic Reasoning and Logic Programming , 1996, Fundam. Informaticae.

[266]  Limsoon Wong,et al.  A query language for multidimensional arrays: design, implementation, and optimization techniques , 1996, SIGMOD '96.

[267]  Helmut Veith,et al.  Succinct representation, leaf languages, and projection reductions , 1996, Proceedings of Computational Complexity (Formerly Structure in Complexity Theory).

[268]  Domenico Saccà.  Deterministic and Non-Deterministic Stable Model Semantics for Unbound DATALOG Queries , 1995, ICDT.

[269]  Carolina Ruiz,et al.  Semantics for Disjunctive Logic Programs with Explicit and Default Negation , 1994, Fundam. Informaticae.

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

[271]  Li-Yan Yuan,et al.  On the Equivalence of Semantics for Normal Logic Programs , 1995, J. Log. Program..

[272]  Stavros S. Cosmadakis,et al.  Parallel evaluation of recursive rule queries , 1985, PODS '86.

[273]  Francesco Buccafurri,et al.  Strong and Weak Constraints in Disjunctive Datalog , 1997, LPNMR.

[274]  EiterThomas,et al.  Complexity and expressive power of logic programming , 2001 .

[275]  Georg Gottlob,et al.  On the complexity of propositional knowledge base revision, updates, and counterfactuals , 1992, Artif. Intell..

[276]  Alexei Lisitsa,et al.  Delta-Languages for Sets and LOGSPACE Computable Graph Transformers , 1997, Theor. Comput. Sci..

[277]  Georg Gottlob,et al.  The complexity of acyclic conjunctive queries , 1998, Proceedings 39th Annual Symposium on Foundations of Computer Science (Cat. No.98CB36280).

[278]  J. Van Leeuwen,et al.  Handbook of theoretical computer science - Part A: Algorithms and complexity; Part B: Formal models and semantics , 1990 .

[279]  Michael Kifer,et al.  A Logic Programming with Complex Objects , 1993, J. Comput. Syst. Sci..

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

[281]  John S. Schlipf,et al.  The expressive powers of the logic programming semantics (extended abstract) , 1990, PODS.

[282]  Egon Börger,et al.  Beitrag zur Reduktion des Entscheidungsproblems auf Klassen von Hornformeln mit kurzen Alternationen , 1974 .

[283]  Petr Stepánek,et al.  Normal Forms and the Complexity of Computations of Logic Programs , 1988, CSL.

[284]  Chiaki Sakama,et al.  Transforming Abductive Logic Programs to Disjunctive Programs , 1993, ICLP.

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

[286]  Harry G. Mairson,et al.  Undecidable Boundedness Problems for Datalog Programs , 1995, J. Log. Program..

[287]  Serge Abiteboul,et al.  Computing with First-Order Logic , 1995, J. Comput. Syst. Sci..

[288]  Georg Gottlob,et al.  Complexity Results for Nonmonotonic Logics , 1992, J. Log. Comput..

[289]  Thomas Eiter,et al.  Expressive Power and Complexity of Partial Models for Disjunctive Deductive Databases , 1998, Theor. Comput. Sci..

[290]  J. A. Robinson,et al.  A Machine-Oriented Logic Based on the Resolution Principle , 1965, JACM.