{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,28]],"date-time":"2025-12-28T19:48:42Z","timestamp":1766951322555},"reference-count":48,"publisher":"Elsevier BV","issue":"1-2","license":[{"start":{"date-parts":[[1995,7,1]],"date-time":"1995-07-01T00:00:00Z","timestamp":804556800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":6591,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[1995,7]]},"DOI":"10.1016\/0304-3975(94)00153-a","type":"journal-article","created":{"date-parts":[[2003,4,25]],"date-time":"2003-04-25T10:09:04Z","timestamp":1051265344000},"page":"145-184","source":"Crossref","is-referenced-by-count":27,"title":["Bottom-up evaluation and query optimization of well-founded models"],"prefix":"10.1016","volume":"146","author":[{"given":"David B.","family":"Kemp","sequence":"first","affiliation":[]},{"given":"Divesh","family":"Srivastava","sequence":"additional","affiliation":[]},{"given":"Peter J.","family":"Stuckey","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0304-3975(94)00153-A_bib1","series-title":"Foundations of Deductive Databases and Logic Programming","first-page":"89","article-title":"Towards a theory of declarative knowledge","author":"Apt","year":"1988"},{"key":"10.1016\/0304-3975(94)00153-A_bib2","series-title":"Proc. Internat. Conf. 5th Generation Computer Systems","first-page":"711","article-title":"A query independent method for magic set computation on stratified database","author":"Balbin","year":"1988"},{"key":"10.1016\/0304-3975(94)00153-A_bib3","article-title":"Magic set computations for stratified databases","author":"Balbin","year":"1987"},{"key":"10.1016\/0304-3975(94)00153-A_bib4","doi-asserted-by":"crossref","first-page":"295","DOI":"10.1016\/0743-1066(91)90030-S","article-title":"Efficient bottom-up computation of queries on stratified databases","volume":"11","author":"Balbin","year":"1991","journal-title":"J. Logic Programming"},{"key":"10.1016\/0304-3975(94)00153-A_bib5","doi-asserted-by":"crossref","first-page":"259","DOI":"10.1016\/0743-1066(87)90004-5","article-title":"A generalization of the differential approach to recursive query relations","volume":"4","author":"Balbin","year":"1987","journal-title":"J. Logic Programming"},{"key":"10.1016\/0304-3975(94)00153-A_bib6","series-title":"On Knowledge Base Management Systems-Integrating Database and AI Systems","first-page":"165","article-title":"Naive evaluation of recursively defined relations","author":"Bancilhon","year":"1985"},{"key":"10.1016\/0304-3975(94)00153-A_bib7","series-title":"Proc. 5th ACM Symp. on Principles of Database Systems","first-page":"1","article-title":"Magic sets and other strange ways to implement logic programs","author":"Bancilhon","year":"1986"},{"key":"10.1016\/0304-3975(94)00153-A_bib8","series-title":"Proc. 1st Internat. Workshop on Logic Programming and Non-monotonic Reasoning","first-page":"69","article-title":"Dualities between alternate semantics for logic programming and nonmonotonic reasoning","author":"Baral","year":"1991"},{"key":"10.1016\/0304-3975(94)00153-A_bib9","series-title":"Proc. ACM Symp. on Principles of Database Systems","first-page":"269","article-title":"On the power of magic","author":"Beeri","year":"1987"},{"key":"10.1016\/0304-3975(94)00153-A_bib10","series-title":"Magic implementation of stratified programs","author":"Beer","year":"1990"},{"key":"10.1016\/0304-3975(94)00153-A_bib11","article-title":"Computation and implementation of non-monotonic deductive databases","author":"Bell","year":"1991"},{"key":"10.1016\/0304-3975(94)00153-A_bib12","series-title":"Proc. 3rd Internat. Conf. on Database Theory","first-page":"335","article-title":"WELL!: An evaluation procedure for all logic programs","author":"Bidoit","year":"1990"},{"key":"10.1016\/0304-3975(94)00153-A_bib13","series-title":"Proc. 1st Internat. Conf. on Deductive and Object-Oriented Databases","first-page":"20","article-title":"Query evaluation in recursive databases: bottom-up and top-down reconciled","author":"Bry","year":"1989"},{"key":"10.1016\/0304-3975(94)00153-A_bib14","series-title":"Proc. Joint Internat. Conf. and Symp. on Logic Programming","first-page":"589","article-title":"A goal oriented approach to computing well founded semantics","author":"Chen","year":"1992"},{"key":"10.1016\/0304-3975(94)00153-A_bib15","series-title":"Proc. ACM Symp. on Principles of Database Systems","first-page":"168","article-title":"Query evaluation under the well founded semantics","author":"Chen","year":"1993"},{"key":"10.1016\/0304-3975(94)00153-A_bib16","series-title":"Proc. 4th Symp. on Logic Programming","first-page":"264","article-title":"Extension tables: memo relations in logic programming","author":"Dietrich","year":"1987"},{"key":"10.1016\/0304-3975(94)00153-A_bib17","doi-asserted-by":"crossref","first-page":"69","DOI":"10.1007\/BF03037151","article-title":"Strict completion of logic programs","volume":"9","author":"Drabent","year":"1991","journal-title":"New Generation Comput."},{"key":"10.1016\/0304-3975(94)00153-A_bib18","series-title":"Logic and Databases","year":"1978"},{"key":"10.1016\/0304-3975(94)00153-A_bib19","series-title":"Proc. 5th Internat. Conf. on Logic Programming","first-page":"1070","article-title":"The stable model semantics for logic programs","author":"Gelfond","year":"1988"},{"key":"10.1016\/0304-3975(94)00153-A_bib20","series-title":"Proc. 1st North American Conf. on Logic Programming","first-page":"981","article-title":"Propagating constraints in recursive deductive databases","author":"Kemp","year":"1989"},{"key":"10.1016\/0304-3975(94)00153-A_bib21","series-title":"Proc. 16th Conf. on Very Large Databases","first-page":"380","article-title":"Right-, left-, and multi-linear rule transformations that maintain context information","author":"Kemp","year":"1990"},{"key":"10.1016\/0304-3975(94)00153-A_bib22","series-title":"Proc. 1993 Internat. Conf. on Logic Programming","first-page":"666","article-title":"Analysis based constraint query optimization","author":"Kemp","year":"1993"},{"key":"10.1016\/0304-3975(94)00153-A_bib23","series-title":"Proc. 1991 Internat. Symp. on Logic Programming","first-page":"336","article-title":"Magic sets and bottom-up evaluation of well-founded models","author":"Kemp","year":"1991"},{"key":"10.1016\/0304-3975(94)00153-A_bib24","series-title":"Proc. 1992 Joint Internat. Conf. and Sympo. on Logic Programming","first-page":"288","article-title":"Query restricted bottom-up evauation in normal form logic","author":"Kemp","year":"1992"},{"key":"10.1016\/0304-3975(94)00153-A_bib25","series-title":"Proc. Internat. Conf. on 5th Generation Computer Systems","first-page":"719","article-title":"Efficient query answering on stratified databases","author":"Kerisit","year":"1988"},{"key":"10.1016\/0304-3975(94)00153-A_bib26","doi-asserted-by":"crossref","first-page":"50","DOI":"10.1016\/0890-5401(91)90059-B","article-title":"The expressive power of stratified programs","volume":"90","author":"Kolaitis","year":"1991","journal-title":"Inform. and Comput."},{"key":"10.1016\/0304-3975(94)00153-A_bib27","doi-asserted-by":"crossref","first-page":"17","DOI":"10.1016\/0306-4379(92)90003-6","article-title":"Safe computation of the well-founded semantics of DATALOG queries","volume":"17","author":"Leone","year":"1992","journal-title":"Inform. Systems"},{"key":"10.1016\/0304-3975(94)00153-A_bib28","series-title":"Foundations of Logic Programming","author":"Lloyd","year":"1987"},{"key":"10.1016\/0304-3975(94)00153-A_bib29","series-title":"Proc. North American Conf. on Logic Programming","first-page":"963","article-title":"D\u00e9j\u00e0vu in fixpoints of logic programs","author":"Maher","year":"1989"},{"key":"10.1016\/0304-3975(94)00153-A_bib30","series-title":"Proc. 1993 ACM Symp. on Principles of Database Systems","first-page":"123","article-title":"An alternating fixpoint tailored to magic programs","author":"Morishita","year":"1993"},{"key":"10.1016\/0304-3975(94)00153-A_bib31","series-title":"Proc. 9 ACM Symp. on the Principles of Database Systems","first-page":"314","article-title":"Magic conditions","author":"Mumick","year":"1990"},{"key":"10.1016\/0304-3975(94)00153-A_bib32","series-title":"Proc. 15th Conf. on Very Large Data Bases","first-page":"173","article-title":"Argument reduction by factoring","author":"Naughton","year":"1989"},{"key":"10.1016\/0304-3975(94)00153-A_bib33","series-title":"Proc. ACM SIGMOD Conf. on Management of Data","first-page":"235","article-title":"Efficient evaluation of right-, left-, and multi-linear rules","author":"Naughton","year":"1989"},{"key":"10.1016\/0304-3975(94)00153-A_bib34","series-title":"Foundations of Deductive Databases and Logic Programming","first-page":"193","article-title":"On the declarative semantics of stratified deductive databases","author":"Przymusinski","year":"1988"},{"key":"10.1016\/0304-3975(94)00153-A_bib35","series-title":"Proc. Internat. Conf. on Very Large Data Bases","first-page":"359","article-title":"Rule ordering bottom-up fixpoint evaluation of logic programs","author":"Ramakrishnan","year":"1990"},{"key":"10.1016\/0304-3975(94)00153-A_bib36","series-title":"Proc. Joint Internat. Conf. and Symp. on Logic Programming","first-page":"288","article-title":"Controlling the search in bottom-up evaluation","author":"Ramakrishnan","year":"1992"},{"key":"10.1016\/0304-3975(94)00153-A_bib37","series-title":"Proc. ACM Symp. on Principles of Database Systems","first-page":"22","article-title":"A procedural semantics for well-founded negation in logic programs","author":"Ross","year":"1989"},{"key":"10.1016\/0304-3975(94)00153-A_bib38","series-title":"Proc. ACM Symp. on Principles of Database Systems","first-page":"161","article-title":"Modular stratification of magic sets for DATALOG programs with negation","author":"Ross","year":"1990"},{"key":"10.1016\/0304-3975(94)00153-A_bib39","series-title":"Proc. ACM Symp. on Principles of Database Systems","first-page":"301","article-title":"Pushing constraint selection","author":"Srivastava","year":"1992"},{"key":"10.1016\/0304-3975(94)00153-A_bib40","series-title":"Proc. 3rd Internat. Conf. on Logic Programming","first-page":"84","article-title":"Old resolution with tabulation","author":"Tamaki","year":"1986"},{"key":"10.1016\/0304-3975(94)00153-A_bib41","series-title":"Proc. 8th ACM Symposium on Principles of Database Systems","first-page":"140","article-title":"Bottom-up beats top-down for Datalog","author":"Ullman","year":"1989"},{"key":"10.1016\/0304-3975(94)00153-A_bib42","series-title":"Proc. Internat. Conf. on Data Engineering","first-page":"247","article-title":"Design overview of the Aditi deductive database system","author":"Vaghani","year":"1991"},{"key":"10.1016\/0304-3975(94)00153-A_bib43","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":"J. ACM"},{"key":"10.1016\/0304-3975(94)00153-A_bib44","series-title":"Proc. 3rd IEEE Internat. Symp. on Logic Programming","first-page":"149","article-title":"Negation as failure using tight derivations for general logic programs","author":"Van Gelder","year":"1986"},{"key":"10.1016\/0304-3975(94)00153-A_bib45","series-title":"Proc. ACM Symp. on Principles of Database Systems","first-page":"1","article-title":"The alternating fixpoint of logic programs with negation","author":"Van Gelder","year":"1989"},{"key":"10.1016\/0304-3975(94)00153-A_bib46","doi-asserted-by":"crossref","first-page":"620","DOI":"10.1145\/116825.116838","article-title":"The well-founded semantics for general logic programs","volume":"38","author":"Van Gelder","year":"1991","journal-title":"J. ACM"},{"key":"10.1016\/0304-3975(94)00153-A_bib47","series-title":"Proc. 2nd Internat. Conf. on Expert Database Systems","article-title":"From QSQ towards QoSaQ: global optimization of recursive queries","author":"Vieille","year":"1988"},{"key":"10.1016\/0304-3975(94)00153-A_bib48","doi-asserted-by":"crossref","first-page":"243","DOI":"10.1016\/0743-1066(93)90041-E","article-title":"Tight, consistent, and computable completions for unrestricted logic programs","volume":"15","author":"Wallace","year":"1993","journal-title":"J. Logic Programming"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:030439759400153A?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:030439759400153A?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,16]],"date-time":"2019-04-16T12:28:20Z","timestamp":1555417700000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/030439759400153A"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1995,7]]},"references-count":48,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[1995,7]]}},"alternative-id":["030439759400153A"],"URL":"https:\/\/doi.org\/10.1016\/0304-3975(94)00153-a","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[1995,7]]}}}