{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,13]],"date-time":"2025-09-13T15:45:33Z","timestamp":1757778333283},"reference-count":12,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1994,2,1]],"date-time":"1994-02-01T00:00:00Z","timestamp":760060800000},"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":7108,"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":[[1994,2]]},"DOI":"10.1016\/0743-1066(94)90051-5","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T23:47:32Z","timestamp":1027640852000},"page":"177-190","source":"Crossref","is-referenced-by-count":33,"title":["A new definition of SLDNF-resolution"],"prefix":"10.1016","volume":"18","author":[{"given":"Krzysztof R.","family":"Apt","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kees","family":"Doets","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"issue":"3","key":"10.1016\/0743-1066(94)90051-5_BIB1","doi-asserted-by":"crossref","first-page":"335","DOI":"10.1007\/BF03037168","article-title":"Acyclic Programs","volume":"29","author":"Apt","year":"1991","journal-title":"New Generation Comput."},{"key":"10.1016\/0743-1066(94)90051-5_BIB2","first-page":"265","article-title":"Proving Termination of General Prolog Programs","volume":"526","author":"Apt","year":"1991"},{"key":"10.1016\/0743-1066(94)90051-5_BIB3","series-title":"Proceedings of the Fifth International Conference on Logic Programming","first-page":"111","article-title":"Constructive Negation Based on the Completed Database","author":"Chan","year":"1988"},{"key":"10.1016\/0743-1066(94)90051-5_BIB4","series-title":"Research Report DOC 79\/59","article-title":"Predicate Logic as a Computational Formalism","author":"Clark","year":"1979"},{"key":"10.1016\/0743-1066(94)90051-5_BIB5","doi-asserted-by":"crossref","DOI":"10.1093\/logcom\/3.5.487","article-title":"Levationis Laus","author":"Doets","year":"1993","journal-title":"J. Logic Comput."},{"key":"10.1016\/0743-1066(94)90051-5_BIB6","series-title":"Proceedings IFIP'74","first-page":"569","article-title":"Predicate Logic as a Programming Language","author":"Kowalski","year":"1974"},{"key":"10.1016\/0743-1066(94)90051-5_BIB7","doi-asserted-by":"crossref","first-page":"231","DOI":"10.1016\/0743-1066(89)90022-8","article-title":"Signed Data Dependencies in Logic Programs","volume":"7","author":"Kunen","year":"1989","journal-title":"J. Logic Programming"},{"key":"10.1016\/0743-1066(94)90051-5_BIB8","series-title":"Foundations of Logic Programming","author":"Lloyd","year":"1984"},{"key":"10.1016\/0743-1066(94)90051-5_BIB9","series-title":"Foundations of Logic Programming","author":"Lloyd","year":"1987"},{"issue":"2","key":"10.1016\/0743-1066(94)90051-5_BIB10","doi-asserted-by":"crossref","first-page":"57","DOI":"10.1016\/0020-0190(92)90012-K","article-title":"A New SLDNF-Tree","volume":"43","author":"Martelli","year":"1992","journal-title":"Inform. Process. Lett."},{"issue":"1","key":"10.1016\/0743-1066(94)90051-5_BIB11","doi-asserted-by":"crossref","first-page":"51","DOI":"10.1016\/0743-1066(84)90023-2","article-title":"Negation as Failure: A Comparison of Clark's Completed Data Base Reiter's Closed World Assumption","volume":"1","author":"Shepherdson","year":"1984","journal-title":"J. Logic Programming"},{"issue":"3","key":"10.1016\/0743-1066(94)90051-5_BIB12","doi-asserted-by":"crossref","first-page":"343","DOI":"10.1016\/0304-3975(89)90106-0","article-title":"A Sound and Complete Semantics for a Version of Negation as Failure","volume":"65","author":"Shepherdson","year":"1989","journal-title":"Theor. Comput. Sci."}],"container-title":["The Journal of Logic Programming"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0743106694900515?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0743106694900515?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,12]],"date-time":"2019-04-12T23:57:45Z","timestamp":1555113465000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0743106694900515"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1994,2]]},"references-count":12,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1994,2]]}},"alternative-id":["0743106694900515"],"URL":"https:\/\/doi.org\/10.1016\/0743-1066(94)90051-5","relation":{},"ISSN":["0743-1066"],"issn-type":[{"value":"0743-1066","type":"print"}],"subject":[],"published":{"date-parts":[[1994,2]]}}}