Depth-Bounded Bottom-Up Evaluation of Logic Program

[1]  C. Cordell Green,et al.  Application of Theorem Proving to Problem Solving , 1969, IJCAI.

[2]  M. Rabin.  Decidability of second-order theories and automata on infinite trees. , 1969 .

[3]  William H. Joyner.  Resolution Strategies as Decision Procedures , 1976, JACM.

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

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

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

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

[8]  Harry R. Lewis,et al.  Complexity Results for Classes of Quantificational Formulas , 1980, J. Comput. Syst. Sci..

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

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

[11]  J. A. Robinson,et al.  Automatic Deduction with Hyper-Resolution , 1983 .

[12]  Harry R. Lewis,et al.  Logical syntax and computational complexity , 1984 .

[13]  David A. Plaisted.  Complete Problems in the First-Order Predicate Calculus , 1984, J. Comput. Syst. Sci..

[14]  Hisao Tamaki,et al.  Enumeration of Success Patterns in Logic Programs , 1983, Theor. Comput. Sci..

[15]  John Potter,et al.  Metalogical Control for Logic Programs , 1985, J. Log. Program..

[16]  David Maier,et al.  Magic sets and other strange ways to implement logic programs (extended abstract) , 1985, PODS '86.

[17]  Hisao Tamaki,et al.  OLD Resolution with Tabulation , 1986, ICLP.

[18]  R. Ramakrishnan,et al.  An amateur's introduction to recursive query processing strategies , 1986, SIGMOD '86.

[19]  John Wylie Lloyd,et al.  Foundations of Logic Programming , 1987, Symbolic Computation.

[20]  Abraham Silberschatz,et al.  Safety of recursive Horn clauses with infinite relations , 1987, PODS '87.

[21]  R. Ramakrishnan,et al.  A framework for testing safety and effective computability of extended datalog , 1988, SIGMOD '88.

[22]  Michael Stonebraker,et al.  Readings in Database Systems , 1988 .

[23]  Tanel Tammet.  The resolution program, able to decide some solvable classes , 1988, Conference on Computer Logic.

[24]  Abraham Silberschatz,et al.  An axiomatic approach to deciding query safety in deductive databases , 1988, PODS '88.

[25]  Jeffrey D. Ullman,et al.  Efficient tests for top-down termination of logical rules , 1988, JACM.

[26]  Michael Kifer,et al.  On Safety, Domain Independence, and Capturability of Database Queries (Preliminary Report) , 1988, JCDKB.

[27]  Michael Kifer,et al.  SYGRAF: Implementing Logic Programs in a Database Style , 1988, IEEE Trans. Software Eng..

[28]  Jan Chomicki,et al.  Temporal deductive databases and infinite objects , 1988, PODS.

[29]  Marianne Baudinet,et al.  Temporal logic programming is complete and expressive , 1989, POPL '89.

[30]  L. Vielle,et al.  Recursive query processing: the power of logic , 1989 .

[31]  Laurent Vieille,et al.  Recursive Query Processing: The Power of Logic , 1989, Theor. Comput. Sci..

[32]  Hirohisa Seki,et al.  On the power of Alexander templates , 1989, PODS.

[33]  Yehoshua Sagiv,et al.  Safety of datalog queries over infinite databases , 1989, PODS '89.

[34]  Martín Abadi,et al.  Temporal Logic Programming , 1989, J. Symb. Comput..

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

[36]  N. K. Zamov,et al.  Maslov's Inverse Method and Decidable Classes , 1989, Ann. Pure Appl. Log..

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

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

[39]  Jan Chomicki,et al.  Relational specifications of infinite query answers , 1989, SIGMOD '89.

[40]  Wolfgang Thomas,et al.  Automata on Infinite Objects , 1991, Handbook of Theoretical Computer Science, Volume B: Formal Models and Sematics.

[41]  Allen Van Gelder,et al.  Deriving constraints among argument sizes in logic programs , 1990, PODS '90.

[42]  Mark E. Stickel,et al.  A Prolog Technology Theorem Prover , 1990, CADE.

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

[44]  Christian G. Fermüller.  A Resolution Variant Deciding some Classes of Clause Sets , 1990, CSL.

[45]  Richard A. O'Keefe,et al.  The Craft of Prolog , 1990 .

[46]  Jan Chomicki,et al.  Functional deductive databases: query processing in the presence of limited function symbols , 1990 .

[47]  Lutz Plümer,et al.  Termination Proofs for Logic Programs Based on Predicate Inequalities , 1990, ICLP.

[48]  Kotagiri Ramamohanarao,et al.  Design overview of the Aditi deductive database system , 1991, [1991] Proceedings. Seventh International Conference on Data Engineering.

[49]  Allen Van Gelder,et al.  Termination detection in logic programs using argument sizes (extended abstract) , 1991, PODS.

[50]  Yehoshua Sagiv,et al.  Inference of Inequality Constraints in Logic Programs. , 1991, PODS 1991.

[51]  Jeffrey F. Naughton,et al.  Bottom-Up Evaluation of Logic Programs , 1991, Computational Logic - Essays in Honor of Alan Robinson.

[52]  Raghu Ramakrishnan,et al.  Magic Templates: A Spellbinding Approach To Logic Programs , 1991, J. Log. Program..

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

[54]  N. Klarlund.  Progress measures, immediate determinacy, and a subset construction for tree automata , 1992 .

[55]  Marianne Baudinet,et al.  Temporal Deductive Databases , 1993, Temporal Databases.

[56]  Christian G. Fermüller,et al.  Resolution Methods for the Decision Problem , 1993, Lecture Notes in Computer Science.

[57]  Oded Shmueli,et al.  Equivalence of DATALOG Queries is Undecidable , 1993, J. Log. Program..

[58]  Jan Chomicki,et al.  Finite representation of infinite query answers , 1993, TODS.