{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:17:04Z","timestamp":1759637824664},"reference-count":29,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1998,2,1]],"date-time":"1998-02-01T00:00:00Z","timestamp":886291200000},"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":5647,"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":[[1998,2]]},"DOI":"10.1016\/s0743-1066(97)00073-3","type":"journal-article","created":{"date-parts":[[2003,4,23]],"date-time":"2003-04-23T19:53:40Z","timestamp":1051127620000},"page":"67-109","source":"Crossref","is-referenced-by-count":12,"title":["Tabulated resolution for the well-founded semantics"],"prefix":"10.1016","volume":"34","author":[{"given":"Roland","family":"Bol","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Lars","family":"Degerstedt","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0743-1066(97)00073-3_BIB1","series-title":"Proc. Int. Logic Programming Symp.","article-title":"A Top-Down Derivation Procedure for Programs with Explicit Negation","author":"Alferes","year":"1994"},{"key":"10.1016\/S0743-1066(97)00073-3_BIB2","first-page":"493","article-title":"Introduction to Logic Programming","volume":"Vol. B","author":"Apt","year":"1990"},{"key":"10.1016\/S0743-1066(97)00073-3_BIB3","doi-asserted-by":"crossref","first-page":"85","DOI":"10.1016\/0304-3975(51)90004-7","article-title":"Negation by Default and Unstratifiable Logic Programs","volume":"78","author":"Bidoit","year":"1991","journal-title":"J. Theoret. Comput. Sci."},{"key":"10.1016\/S0743-1066(97)00073-3_BIB4","doi-asserted-by":"crossref","first-page":"147","DOI":"10.1016\/0743-1066(93)90017-B","article-title":"Loop Checking and Negation","volume":"15","author":"Bol","year":"1993","journal-title":"J. Logic Programming"},{"key":"10.1016\/S0743-1066(97)00073-3_BIB5","series-title":"Proc. Tenth Int. Conf. Logic Programming","article-title":"The Underlying Search for Magic Templates and Tabulation","author":"Bol","year":"1993"},{"key":"10.1016\/S0743-1066(97)00073-3_BIB6","doi-asserted-by":"crossref","first-page":"73","DOI":"10.1016\/0020-0190(91)90012-7","article-title":"A Simple Fixed Point Characterization of Three-Valued Stable Model Semantics","volume":"40","author":"Bonnier","year":"1991","journal-title":"Inform. Processing Lett."},{"key":"10.1016\/S0743-1066(97)00073-3_BIB7","doi-asserted-by":"crossref","first-page":"161","DOI":"10.1016\/0743-1066(94)00028-5","article-title":"Efficient Top-Down Computation of Queries under the Well-Founded Semantics","volume":"24","author":"Chen","year":"1995","journal-title":"J. Logic Programming"},{"key":"10.1016\/S0743-1066(97)00073-3_BIB8","series-title":"Proc. Joint Int. Conf. Symp. Logic Programming","first-page":"589","article-title":"A Goal-Oriented Approach to Computing Well-Founded Semantics","author":"Chen","year":"1992"},{"key":"10.1016\/S0743-1066(97)00073-3_BIB9","series-title":"Proc. Twelfth ACM SIGACT-SIGMOD-SIGART Symp. Principles Database Syst.","first-page":"168","article-title":"A Query Evaluation under the Well-Founded Semantics","author":"Chen","year":"1993"},{"key":"10.1016\/S0743-1066(97)00073-3_BIB10","series-title":"Logic and Databases","article-title":"Negation as Failure","author":"Clark","year":"1978"},{"key":"10.1016\/S0743-1066(97)00073-3_BIB11","article-title":"Paraconsistent Extended Logic Programming with Constraints","author":"Dam\u00e1sio","year":"1996"},{"key":"10.1016\/S0743-1066(97)00073-3_BIB12","article-title":"Tabulated Resolution for Well-Founded Semantics","author":"Degerstedt","year":"1993"},{"key":"10.1016\/S0743-1066(97)00073-3_BIB13","article-title":"Tabulation-Based Logic Programming: A Multi-Level View of Query Answering","author":"Degerstedt","year":"1996"},{"key":"10.1016\/S0743-1066(97)00073-3_BIB14","series-title":"Non-Monotonic Extensions of Logic Programming","first-page":"181","article-title":"Magic Computation for Well-Founded Semantics","volume":"927","author":"Degerstedt","year":"1995"},{"key":"10.1016\/S0743-1066(97)00073-3_BIB15","series-title":"Proc. Joint Int. Conf. Symp. Logic Programming","first-page":"288","article-title":"Query Restricted Bottom-Up Evaluation of Normal Logic Programs","author":"Kemp","year":"1992"},{"key":"10.1016\/S0743-1066(97)00073-3_BIB16","article-title":"A Specification of an Abstract Prolog Machine and Its Application to Partial Evaluation","volume":"69","author":"Komorowski","year":"1981"},{"key":"10.1016\/S0743-1066(97)00073-3_BIB17","series-title":"Fundamenta Informaticae","first-page":"41","article-title":"A Prolegomenon to Partial Deduction","author":"Komorowski","year":"1993"},{"key":"10.1016\/S0743-1066(97)00073-3_BIB18","series-title":"Foundations of Logic Programming","author":"Lloyd","year":"1987"},{"key":"10.1016\/S0743-1066(97)00073-3_BIB19","doi-asserted-by":"crossref","first-page":"217","DOI":"10.1016\/0743-1066(91)90027-M","article-title":"Partial Evaluation in Logic Programming","volume":"11","author":"Lloyd","year":"1991","journal-title":"J. Logic Programming"},{"key":"10.1016\/S0743-1066(97)00073-3_BIB20","series-title":"Twelvth Int. Joint Conf. Artif. Intell.","first-page":"863","article-title":"Derivation Procedures for Extended Stable Models","author":"Pereira","year":"1991"},{"key":"10.1016\/S0743-1066(97)00073-3_BIB21","series-title":"Proc. Assoc. Computat. Linguistics, 21th Ann. Meeting","first-page":"137","article-title":"Parsing as Deduction","author":"Periera","year":"1983"},{"key":"10.1016\/S0743-1066(97)00073-3_BIB22","series-title":"Proc. Conf. Automated Reasoning","article-title":"Soundness and Completeness of Partial Deductions for Well-Founded Semantics","author":"Przymusinska","year":"1992"},{"key":"10.1016\/S0743-1066(97)00073-3_BIB23","series-title":"Proc. 8th Symp. Principles Database Syst.","first-page":"11","article-title":"Every Logic Program Has a Natural Stratification and an Iterated Fixed Point Model","author":"Przymusinski","year":"1989"},{"key":"10.1016\/S0743-1066(97)00073-3_BIB24","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":"J. Logic Programming"},{"key":"10.1016\/S0743-1066(97)00073-3_BIB25","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0743-1066(92)90019-Y","article-title":"A Procedural Semantics for Well-Founded Negation in Logic Programs","volume":"13","author":"Ross","year":"1992","journal-title":"J. Logic Programming"},{"key":"10.1016\/S0743-1066(97)00073-3_BIB26","series-title":"Proc. Fifth Int. Conf. Symp. Logic Programming","first-page":"195","article-title":"A Query Evaluation Method for Stratified Programs under the Extended CWA","author":"Seki","year":"1988"},{"key":"10.1016\/S0743-1066(97)00073-3_BIB27","series-title":"Proc. Third Int. Conf. Logic Programming","first-page":"84","article-title":"OLD Resolution with Tabulation","volume":"225","author":"Tamaki","year":"1986"},{"key":"10.1016\/S0743-1066(97)00073-3_BIB28","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\/S0743-1066(97)00073-3_BIB29","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":"Theoret. Comput. Sci."}],"container-title":["The Journal of Logic Programming"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0743106697000733?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0743106697000733?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,16]],"date-time":"2019-04-16T01:26:17Z","timestamp":1555377977000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0743106697000733"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998,2]]},"references-count":29,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1998,2]]}},"alternative-id":["S0743106697000733"],"URL":"https:\/\/doi.org\/10.1016\/s0743-1066(97)00073-3","relation":{},"ISSN":["0743-1066"],"issn-type":[{"value":"0743-1066","type":"print"}],"subject":[],"published":{"date-parts":[[1998,2]]}}}