{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,6]],"date-time":"2025-06-06T14:47:39Z","timestamp":1749221259401},"reference-count":56,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1995,10,1]],"date-time":"1995-10-01T00:00:00Z","timestamp":812505600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,19]],"date-time":"2013-07-19T00:00:00Z","timestamp":1374192000000},"content-version":"vor","delay-in-days":6501,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["The Journal of Logic Programming"],"published-print":{"date-parts":[[1995,10]]},"DOI":"10.1016\/0743-1066(94)00030-a","type":"journal-article","created":{"date-parts":[[2003,4,25]],"date-time":"2003-04-25T06:09:04Z","timestamp":1051250944000},"page":"1-31","source":"Crossref","is-referenced-by-count":12,"title":["Depth-bounded bottom-up evaluation of logic programs"],"prefix":"10.1016","volume":"25","author":[{"given":"Jan","family":"Chomicki","sequence":"first","affiliation":[]}],"member":"78","reference":[{"issue":"3","key":"10.1016\/0743-1066(94)00030-A_BIB1","doi-asserted-by":"crossref","DOI":"10.1016\/S0747-7171(89)80070-7","article-title":"Temporal logic programming","volume":"8","author":"Abadi","year":"1989","journal-title":"Journal of Symbolic Computation"},{"issue":"1","key":"10.1016\/0743-1066(94)00030-A_BIB2","first-page":"3","article-title":"The generalised completeness of Horn predicate logic as a programming language","volume":"4","author":"Andreka","year":"1978","journal-title":"Acta Cybernetica"},{"key":"10.1016\/0743-1066(94)00030-A_BIB3","series-title":"ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems","article-title":"Magic, sets and other strange ways to implement logic programs","author":"Bancilhon","year":"1986"},{"key":"10.1016\/0743-1066(94)00030-A_BIB4","series-title":"Readings in Database Systems","article-title":"An amateur's introduction to recursive query processing strategies","author":"Bancilhon","year":"1988"},{"key":"10.1016\/0743-1066(94)00030-A_BIB5","series-title":"ACM SIGACT-SIGPLAN Symposium on Principles of Programming Languages","article-title":"Temporal logic programming is complete and expressive","author":"Baudinet","year":"1989"},{"key":"10.1016\/0743-1066(94)00030-A_BIB6","series-title":"ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems","article-title":"Inference of inequality constraints in logic programs","author":"Brodsky","year":"1991"},{"key":"10.1016\/0743-1066(94)00030-A_BIB7","doi-asserted-by":"crossref","first-page":"99","DOI":"10.1016\/0022-0000(82)90012-5","article-title":"Structure and complexity of relational queries","volume":"25","author":"Chandra","year":"1982","journal-title":"Journal of Computer and System Sciences"},{"key":"10.1016\/0743-1066(94)00030-A_BIB8","article-title":"Functional deductive databases: Query processing in the presence of limited function symbols","author":"Chomicki","year":"1982"},{"key":"10.1016\/0743-1066(94)00030-A_BIB9","series-title":"ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems","article-title":"Polynomial-time computable queries in temporal deductive databases","author":"Chomicki","year":"1990"},{"key":"10.1016\/0743-1066(94)00030-A_BIB10","series-title":"ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems","article-title":"Temporal deductive databases and infinite objects","author":"Chomicki","year":"1988"},{"key":"10.1016\/0743-1066(94)00030-A_BIB11","series-title":"ACM SIGMOD International conference on Management of Data","article-title":"Relational specifications of infinite query answers","author":"Chomicki","year":"1989"},{"issue":"2","key":"10.1016\/0743-1066(94)00030-A_BIB12","doi-asserted-by":"crossref","first-page":"181","DOI":"10.1145\/151634.151635","article-title":"Finite representation of infinite query answers","volume":"18","author":"Chomicki","year":"1993","journal-title":"ACM Transactions on Database Systems"},{"key":"10.1016\/0743-1066(94)00030-A_BIB13","series-title":"Computation and Proof Theory","first-page":"101","article-title":"Logical syntax and computational complexity","volume":"1104","author":"Denenberg","year":"1984"},{"key":"10.1016\/0743-1066(94)00030-A_BIB14","series-title":"Workshop on Computer Science Logic","first-page":"128","article-title":"A resolution variant deciding some classes of clause sets","author":"Ferm\u00fcller","year":"1990"},{"key":"10.1016\/0743-1066(94)00030-A_BIB15","doi-asserted-by":"crossref","DOI":"10.1007\/3-540-56732-1","article-title":"Resolution Methods for the Decision Problem","author":"Ferm\u00fcller","year":"1993"},{"key":"10.1016\/0743-1066(94)00030-A_BIB16","series-title":"L'Enseignement Mathematique","article-title":"Alternation and the Ackermann case of the decision problem","author":"F\u00fcrer","year":"1981"},{"key":"10.1016\/0743-1066(94)00030-A_BIB17","series-title":"International Joint Conference on Artificial Intelligence","article-title":"Application of theorem proving to problem solving","author":"Green","year":"1969"},{"issue":"3","key":"10.1016\/0743-1066(94)00030-A_BIB18","doi-asserted-by":"crossref","first-page":"398","DOI":"10.1145\/321958.321960","article-title":"Resolution strategies as decision procedures","volume":"23","author":"Joyner","year":"1976","journal-title":"Journal of the ACM"},{"key":"10.1016\/0743-1066(94)00030-A_BIB19","series-title":"Data and Knowledge Base Conference","article-title":"On safety, domain independence and capturability of database queries","author":"Kifer","year":"1988"},{"issue":"7","key":"10.1016\/0743-1066(94)00030-A_BIB20","doi-asserted-by":"crossref","first-page":"922","DOI":"10.1109\/32.42735","article-title":"SYGRAF: Implementing logic programs in a database style","volume":"14","author":"Kifer","year":"1988","journal-title":"IEEE Transactions on Software Engineering"},{"key":"10.1016\/0743-1066(94)00030-A_BIB21","series-title":"ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems","first-page":"52","article-title":"An axiomatic approach to deciding query safety in deductive databases","author":"Kifer","year":"1988"},{"key":"10.1016\/0743-1066(94)00030-A_BIB22","series-title":"IEEE Symposium on Logic in Computer Science","article-title":"Progress measures, immediate determinacy, and a subset construction for tree automata","author":"Klarlund","year":"1992"},{"key":"10.1016\/0743-1066(94)00030-A_BIB23","series-title":"ACM SIGMOD International Conference on Management of Data","article-title":"A. framework for testing safety and effective computability of extended datalog","author":"Krishnamurthy","year":"1988"},{"key":"10.1016\/0743-1066(94)00030-A_BIB24","series-title":"Workshop on Computer Science Logic","first-page":"225","article-title":"Deciding Horn clauses by hyperresolution","author":"Leitsch","year":"1989"},{"key":"10.1016\/0743-1066(94)00030-A_BIB25","doi-asserted-by":"crossref","first-page":"317","DOI":"10.1016\/0022-0000(80)90027-6","article-title":"Complexity results for classes of quantificational formulas","volume":"21","author":"Lewis","year":"1980","journal-title":"Journal of Computer and System Sciences"},{"key":"10.1016\/0743-1066(94)00030-A_BIB26","series-title":"Foundations of Logic Programming","author":"Lloyd","year":"1987"},{"key":"10.1016\/0743-1066(94)00030-A_BIB27","series-title":"A. Logical Language for Data and Knowledge Bases","author":"Naqvi","year":"1989"},{"key":"10.1016\/0743-1066(94)00030-A_BIB28","series-title":"Computational Logic","first-page":"640","article-title":"Bottom-up evaluation of logic programs","author":"Naughton","year":"1991"},{"key":"10.1016\/0743-1066(94)00030-A_BIB29","series-title":"The Craft of Prolog","author":"O'Keefe","year":"1990"},{"key":"10.1016\/0743-1066(94)00030-A_BIB30","doi-asserted-by":"crossref","first-page":"8","DOI":"10.1016\/0022-0000(84)90010-2","article-title":"Complete problems in the first-order predicate calculus","volume":"29","author":"Plaisted","year":"1984","journal-title":"Journal of Computer and System Sciences"},{"key":"10.1016\/0743-1066(94)00030-A_BIB31","series-title":"International Conference on Logic Programming","first-page":"634","article-title":"Termination proofs for logic programs based on predicate inequalities","author":"Pl\u00fcmer","year":"1990"},{"key":"10.1016\/0743-1066(94)00030-A_BIB32","first-page":"1","article-title":"Decidability of second-order theories and automata on infinite trees","volume":"141","author":"Rabin","year":"1969","journal-title":"Transactions AMS"},{"issue":"3 & 4","key":"10.1016\/0743-1066(94)00030-A_BIB33","doi-asserted-by":"crossref","first-page":"189","DOI":"10.1016\/0743-1066(91)90026-L","article-title":"Magic templates: A spellbinding approach to logic programs","volume":"11","author":"Ramakrishnan","year":"1991","journal-title":"Journal of Logic Programming"},{"key":"10.1016\/0743-1066(94)00030-A_BIB34","series-title":"ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems","first-page":"328","article-title":"Safety of recursive Horn clauses with infinite relations","author":"Ramakrishnan","year":"1987"},{"key":"10.1016\/0743-1066(94)00030-A_BIB35","series-title":"International Conference on Very Large Data Bases","first-page":"238","article-title":"CORAL\u2014Control, relations and logic","author":"Ramakrishnan","year":"1987"},{"key":"10.1016\/0743-1066(94)00030-A_BIB36","first-page":"227","article-title":"Automatic deduction with hyper resolution","volume":"1","author":"Robinson","year":"1965","journal-title":"International Journal of Computer Mathematics"},{"key":"10.1016\/0743-1066(94)00030-A_BIB37","series-title":"ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems","first-page":"160","article-title":"Safety of Datalog queries over infinite databases","author":"Sagiv","year":"1965"},{"key":"10.1016\/0743-1066(94)00030-A_BIB38","doi-asserted-by":"crossref","first-page":"227","DOI":"10.1016\/0304-3975(84)90119-1","article-title":"Enumeration of success patterns in logic programs","volume":"34","author":"Sato","year":"1984","journal-title":"Theoretical Computer Science"},{"key":"10.1016\/0743-1066(94)00030-A_BIB39","series-title":"ACM SIGACT-SIGMOD-SIGART, Symposium on Principles of Database Systems","first-page":"150","article-title":"On the power of Alexander templates","author":"Seki","year":"1984"},{"issue":"3","key":"10.1016\/0743-1066(94)00030-A_BIB40","doi-asserted-by":"crossref","first-page":"231","DOI":"10.1016\/0743-1066(93)90040-N","article-title":"Equivalence of Datalog queries is undecidable","volume":"15","author":"Shmueli","year":"1993","journal-title":"Journal of Logic Programming"},{"key":"10.1016\/0743-1066(94)00030-A_BIB41","series-title":"ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems","article-title":"Termination detection in logic programs using argument sizes","author":"Sohn","year":"1991"},{"key":"10.1016\/0743-1066(94)00030-A_BIB42","series-title":"IEEE Symposium on Logic Programming","first-page":"212","article-title":"A. Prolog technology theorem prover","author":"Stickel","year":"1984"},{"key":"10.1016\/0743-1066(94)00030-A_BIB43","series-title":"International Conference on Logic Programming","first-page":"84","article-title":"OLD resolution with tabulation","author":"Tamaki","year":"1986"},{"key":"10.1016\/0743-1066(94)00030-A_BIB44","series-title":"COLOG-88","first-page":"300","article-title":"The resolution program, able to decide some solvable classes","author":"Tammet","year":"1990"},{"key":"10.1016\/0743-1066(94)00030-A_BIB45","doi-asserted-by":"crossref","first-page":"215","DOI":"10.1007\/BF01932293","article-title":"Horn clause computability","volume":"17","author":"T\u00e4rnlund","year":"1977","journal-title":"BIT"},{"key":"10.1016\/0743-1066(94)00030-A_BIB46","first-page":"133","article-title":"Automata on infinite objects","volume":"vol. B","author":"Thomas","year":"1990"},{"key":"10.1016\/0743-1066(94)00030-A_BIB47","volume":"vol. 1","author":"Ullman","year":"1988"},{"key":"10.1016\/0743-1066(94)00030-A_BIB48","volume":"vol. 2","author":"Ullman","year":"1989"},{"issue":"2","key":"10.1016\/0743-1066(94)00030-A_BIB49","doi-asserted-by":"crossref","first-page":"345","DOI":"10.1145\/42282.42285","article-title":"Efficient tests for top-down termination of logical rules","volume":"35","author":"Ullman","year":"1988","journal-title":"Journal of the ACM"},{"key":"10.1016\/0743-1066(94)00030-A_BIB50","series-title":"IEEE International Conference on Data Engineering","first-page":"240","article-title":"Design overview of the Aditi deductive database system","author":"Vaghani","year":"1991"},{"issue":"4","key":"10.1016\/0743-1066(94)00030-A_BIB51","doi-asserted-by":"crossref","first-page":"733","DOI":"10.1145\/321978.321991","article-title":"The semantics of predicate logic as a programming language","volume":"23","author":"Van Emden","year":"1976","journal-title":"Journal of the ACM"},{"key":"10.1016\/0743-1066(94)00030-A_BIB52","series-title":"ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems","first-page":"47","article-title":"Deriving constraints among argument sizes in logic programs","author":"Van Gelder","year":"1976"},{"key":"10.1016\/0743-1066(94)00030-A_BIB53","series-title":"ACM SIGACT Symposium on Theory of Computing","first-page":"137","article-title":"The complexity of relational query languages","author":"Vardi","year":"1982"},{"issue":"3","key":"10.1016\/0743-1066(94)00030-A_BIB54","doi-asserted-by":"crossref","first-page":"203","DOI":"10.1016\/0743-1066(85)90019-6","article-title":"Metalogical control for logic programs","volume":"2","author":"Vasak","year":"1982","journal-title":"Journal of Logic Programming"},{"issue":"1","key":"10.1016\/0743-1066(94)00030-A_BIB55","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0304-3975(89)90088-1","article-title":"Recursive query processing: The power of logic","volume":"69","author":"Vieille","year":"1989","journal-title":"Theoretical Computer Science"},{"key":"10.1016\/0743-1066(94)00030-A_BIB56","doi-asserted-by":"crossref","first-page":"165","DOI":"10.1016\/0168-0072(89)90053-5","article-title":"Maslov's inverse method and decidable classes","volume":"42","author":"Zamov","year":"1989","journal-title":"Annals of Pure and Applied Logic"}],"container-title":["The Journal of Logic Programming"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:074310669400030A?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:074310669400030A?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,16]],"date-time":"2019-04-16T10:21:33Z","timestamp":1555410093000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/074310669400030A"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1995,10]]},"references-count":56,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1995,10]]}},"alternative-id":["074310669400030A"],"URL":"https:\/\/doi.org\/10.1016\/0743-1066(94)00030-a","relation":{},"ISSN":["0743-1066"],"issn-type":[{"value":"0743-1066","type":"print"}],"subject":[],"published":{"date-parts":[[1995,10]]}}}