{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,1,2]],"date-time":"2024-01-02T15:40:33Z","timestamp":1704210033486},"reference-count":33,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[1993,2,1]],"date-time":"1993-02-01T00:00:00Z","timestamp":728524800000},"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":7473,"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":[[1993,2]]},"DOI":"10.1016\/0743-1066(93)90041-e","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T03:47:32Z","timestamp":1027655252000},"page":"243-273","source":"Crossref","is-referenced-by-count":14,"title":["Tight, consistent, and computable completions for unrestricted logic programs"],"prefix":"10.1016","volume":"15","author":[{"given":"Mark","family":"Wallace","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0743-1066(93)90041-E_BIB1","series-title":"Foundations of Deductive Databases and Logic Programming","article-title":"Towards a Theory of Declarative Knowledge","author":"Apt","year":"1987"},{"key":"10.1016\/0743-1066(93)90041-E_BIB2","doi-asserted-by":"crossref","first-page":"25","DOI":"10.1016\/S0019-9958(82)91234-7","article-title":"Recursion Theoretic Complexity of the Semantics of Predicate Logic as a Programming Language","volume":"54","author":"Blair","year":"1982","journal-title":"Information and Control"},{"key":"10.1016\/0743-1066(93)90041-E_BIB3","series-title":"Technical Report 88\/33","article-title":"Properties of Logic Programs Defined by Atomic Level Mappings","author":"Cavedon","year":"1988"},{"key":"10.1016\/0743-1066(93)90041-E_BIB4","series-title":"Technical Report","article-title":"Post Correspondence Problem and Prolog Programs","author":"Cholak","year":"1988"},{"key":"10.1016\/0743-1066(93)90041-E_BIB5","series-title":"Journal of Logic Programming","article-title":"A Completeness Theorem for SLDNF-Resolution","author":"Cavedon","year":"1990"},{"key":"10.1016\/0743-1066(93)90041-E_BIB6","series-title":"Logic and Databases","first-page":"293","article-title":"Negation as Failure","author":"Clark","year":"1977"},{"key":"10.1016\/0743-1066(93)90041-E_BIB7","series-title":"micro-PROLOG: Programming in Logic:","author":"Clark","year":"1983"},{"key":"10.1016\/0743-1066(93)90041-E_BIB8","series-title":"Proc. 7th Conf. of the AISB","first-page":"61","article-title":"An Experiment with Programming Using Pure Negation","author":"Chan","year":"1989"},{"key":"10.1016\/0743-1066(93)90041-E_BIB9","series-title":"Technical Report IR-KB-52, ECRC, 1989","article-title":"Generalizing Allowedness While Retaining Completeness of SLDNF-Resolution","author":"Decker","year":"1990"},{"issue":"1","key":"10.1016\/0743-1066(93)90041-E_BIB10","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 Computing"},{"issue":"4","key":"10.1016\/0743-1066(93)90041-E_BIB11","doi-asserted-by":"crossref","first-page":"295","DOI":"10.1016\/S0743-1066(85)80005-4","article-title":"A Kripke-Kleene Semantics for Logic Programs","volume":"2","author":"Fitting","year":"1985","journal-title":"Journal of Logic Programming"},{"key":"10.1016\/0743-1066(93)90041-E_BIB12","series-title":"Proc. AAAI'87,","first-page":"207","article-title":"On Stratified Autoepistemic Theories","author":"Gelfond","year":"1987"},{"key":"10.1016\/0743-1066(93)90041-E_BIB13","doi-asserted-by":"crossref","DOI":"10.1016\/0304-3975(87)90045-4","article-title":"Linear Logic","volume":"50","author":"Girard","year":"1987","journal-title":"Theoretical Computer Science"},{"key":"10.1016\/0743-1066(93)90041-E_BIB14","first-page":"1070","article-title":"The Stable Model Semantics for Logic Programming","author":"Gelfond","year":"1988","journal-title":"Proc. 1988 Conf. and Symp. on Logic Programming"},{"issue":"4","key":"10.1016\/0743-1066(93)90041-E_BIB15","doi-asserted-by":"crossref","first-page":"289","DOI":"10.1016\/0743-1066(87)90007-0","article-title":"Negation in Logic Programming","volume":"4","author":"Kunen","year":"1987","journal-title":"Journal of Logic Programming"},{"key":"10.1016\/0743-1066(93)90041-E_BIB16","first-page":"978","article-title":"Some Remarks on the Completed Database","author":"Kunen","year":"1988","journal-title":"Proc. 1988 Conf. and Symp. on Logic Programming"},{"issue":"3","key":"10.1016\/0743-1066(93)90041-E_BIB17","doi-asserted-by":"crossref","DOI":"10.1016\/0743-1066(89)90022-8","article-title":"Signed Data Dependencies in Logic Programs","volume":"7","author":"Kunen","year":"1989","journal-title":"Journal of Logic Programming"},{"key":"10.1016\/0743-1066(93)90041-E_BIB18","series-title":"Foundations of Deductive Databases and Logic Programming","article-title":"On the Declarative Semantics of Logic Programs with Negation","author":"Lifschitz","year":"1987"},{"key":"10.1016\/0743-1066(93)90041-E_BIB19","series-title":"Foundations of Logic Programming","author":"Lloyd","year":"1987"},{"key":"10.1016\/0743-1066(93)90041-E_BIB20","first-page":"600","article-title":"The Relationship Between Logic Program Semantics and Non-Monotonic Reasoning","author":"Marek","year":"1989","journal-title":"Proc. 6th Int. Conf. on Logic Programming"},{"key":"10.1016\/0743-1066(93)90041-E_BIB21","series-title":"Foundations of Deductive Databases and Logic Programming","article-title":"On the Declarative Semantics of Deductive Databases and Logic Programs","author":"Przymusinski","year":"1987"},{"key":"10.1016\/0743-1066(93)90041-E_BIB22","doi-asserted-by":"crossref","first-page":"11","DOI":"10.1145\/73721.73723","article-title":"Every Program has a Natural Stratification and an Iterated Least Fixpoint Model","author":"Przymusinski","year":"1989","journal-title":"Proc. 8th Symp. on Principles of Database Systems"},{"key":"10.1016\/0743-1066(93)90041-E_BIB23","article-title":"Non-Monotonic Formalisms and Logic Programming","author":"Przymusinski","year":"1989","journal-title":"Proc. 6th Int. Conf. on Logic Programming"},{"key":"10.1016\/0743-1066(93)90041-E_BIB24","article-title":"Well-Founded Completions of Logic Programs","author":"Przymusinski","year":"1991","journal-title":"Proc. 8th Int. Conf. on Logic Programming"},{"key":"10.1016\/0743-1066(93)90041-E_BIB25","doi-asserted-by":"crossref","first-page":"22","DOI":"10.1145\/73721.73724","article-title":"A Procedural Semantics for Well-Founded Negation in Logic Programs","author":"Ross","year":"1989","journal-title":"Proc. 8th Symp. on Principles of Database Systems"},{"key":"10.1016\/0743-1066(93)90041-E_BIB26","series-title":"Foundations of Deductive Databases and Logic Programming","article-title":"Negation in Logic Programming","author":"Shepherdson","year":"1987"},{"key":"10.1016\/0743-1066(93)90041-E_BIB27","series-title":"Foundations of Deductive Databases and Logic Programming","first-page":"217","article-title":"On Domain Independent Databases","author":"Topor","year":"1988"},{"issue":"4","key":"10.1016\/0743-1066(93)90041-E_BIB28","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(93)90041-E_BIB29","doi-asserted-by":"crossref","DOI":"10.1145\/73721.73722","article-title":"The Alternating Fixpoint of Logic Programs with Negation","author":"van Gelder","year":"1989","journal-title":"Proc. 8th Symp. on Principles of Database Systems"},{"issue":"2","key":"10.1016\/0743-1066(93)90041-E_BIB30","doi-asserted-by":"crossref","first-page":"109","DOI":"10.1016\/0743-1066(89)90032-0","article-title":"Negation as Failure Using Tight Derivations for General Logic Programs","volume":"6","author":"van Gelder","year":"1989","journal-title":"Journal of Logic Programming"},{"issue":"3","key":"10.1016\/0743-1066(93)90041-E_BIB31","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":"Journal of the ACM"},{"key":"10.1016\/0743-1066(93)90041-E_BIB32","doi-asserted-by":"crossref","first-page":"269","DOI":"10.1016\/0743-1066(89)90017-4","article-title":"A Computable Semantics for General Logic Programs","volume":"6","author":"Wallace","year":"1989","journal-title":"Journal of Logic Programming"},{"key":"10.1016\/0743-1066(93)90041-E_BIB33","series-title":"Proc. 9th European Conf. on Artificial Intelligence","article-title":"Unrestricted Logic Programs, or If Stratification is the Cure, What is the Malady","author":"Wallace","year":"1990"}],"container-title":["The Journal of Logic Programming"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:074310669390041E?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:074310669390041E?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2024,1,2]],"date-time":"2024-01-02T15:11:19Z","timestamp":1704208279000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/074310669390041E"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1993,2]]},"references-count":33,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1993,2]]}},"alternative-id":["074310669390041E"],"URL":"https:\/\/doi.org\/10.1016\/0743-1066(93)90041-e","relation":{},"ISSN":["0743-1066"],"issn-type":[{"value":"0743-1066","type":"print"}],"subject":[],"published":{"date-parts":[[1993,2]]}}}