{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T23:17:19Z","timestamp":1725664639512},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540594871"},{"type":"electronic","value":"9783540492825"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1995]]},"DOI":"10.1007\/3-540-59487-6_10","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T17:18:21Z","timestamp":1330276701000},"page":"127-142","source":"Crossref","is-referenced-by-count":3,"title":["Loop checking and the well-founded semantics"],"prefix":"10.1007","author":[{"given":"Vladimir","family":"Lifschitz","sequence":"first","affiliation":[]},{"given":"Norman","family":"McCain","sequence":"additional","affiliation":[]},{"given":"Teodor C.","family":"Przymusinski","sequence":"additional","affiliation":[]},{"given":"Robert F.","family":"St\u00e4rk","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,5,31]]},"reference":[{"key":"10_CR1","unstructured":"Roland Bol and Lars Degerstedt. The underlying search for magic templates and tabulation. In Logic Programming: Proceedings of the Tenth Int'l Conf. on Logic Programming, pages 793\u2013811, 1993."},{"key":"10_CR2","unstructured":"Roland Bol. Loop Checking in Logic Programming. PhD thesis, University of Amsterdam, 1991."},{"key":"10_CR3","doi-asserted-by":"crossref","unstructured":"Weidong Chen and David Warren. Query evaluation under the well founded semantics. In The Twelfth ACM Symposium on Principles of Database Systems, 1993.","DOI":"10.1145\/153850.153865"},{"key":"10_CR4","doi-asserted-by":"crossref","first-page":"293","DOI":"10.1007\/978-1-4684-3384-5_11","volume-title":"Logic and Data Bases","author":"K. Clark","year":"1978","unstructured":"Keith Clark. Negation as failure. In Herve Gallaire and Jack Minker, editors, Logic and Data Bases, pages 293\u2013322. Plenum Press, New York, 1978."},{"key":"10_CR5","doi-asserted-by":"crossref","first-page":"365","DOI":"10.1007\/BF03037169","volume":"9","author":"M. Gelfond","year":"1991","unstructured":"Michael Gelfond and Vladimir Lifschitz. Classical negation in logic programs and disjunctive databases. New Generation Computing, 9:365\u2013385, 1991.","journal-title":"New Generation Computing"},{"key":"10_CR6","doi-asserted-by":"crossref","first-page":"387","DOI":"10.1007\/BF03037170","volume":"9","author":"R. Kowalski","year":"1991","unstructured":"Robert Kowalski and Fariba Sadri. Logic programs with exceptions. New Generation Computing, 9:387\u2013400, 1991.","journal-title":"New Generation Computing"},{"issue":"3","key":"10_CR7","doi-asserted-by":"crossref","first-page":"231","DOI":"10.1016\/0743-1066(89)90022-8","volume":"7","author":"K. Kunen","year":"1989","unstructured":"Kenneth Kunen. Signed data dependencies in logic programs. Journal of Logic Programming, 7(3):231\u2013245, 1989.","journal-title":"Journal of Logic Programming"},{"key":"10_CR8","doi-asserted-by":"crossref","unstructured":"Vladimir Lifschitz. SLDNF, constructive negation and grounding. In Proc. of ICLP-95, 1995. To appear.","DOI":"10.7551\/mitpress\/4298.003.0058"},{"issue":"4","key":"10_CR9","doi-asserted-by":"crossref","first-page":"367","DOI":"10.3176\/phys.math.1986.4.03","volume":"35","author":"G. Mints","year":"1986","unstructured":"Grigori Mints. A complete calculus for pure Prolog. Proc. Academy of Sciences of Estonian SSR, 35(4):367\u2013380, 1986. In Russian.","journal-title":"Proc. Academy of Sciences of Estonian SSR"},{"key":"10_CR10","doi-asserted-by":"crossref","unstructured":"Teodor Przymusinski. The well-founded semantics coincides with the three-valued stable semantics. Fundamenta Informaticae, pages 445\u2013464, 1990.","DOI":"10.3233\/FI-1990-13404"},{"key":"10_CR11","doi-asserted-by":"crossref","first-page":"401","DOI":"10.1007\/BF03037171","volume":"9","author":"T. Przymusinski","year":"1991","unstructured":"Teodor Przymusinski. Stable semantics for disjunctive programs. New Generation Computing, 9:401\u2013424, 1991.","journal-title":"New Generation Computing"},{"key":"10_CR12","doi-asserted-by":"crossref","first-page":"141","DOI":"10.1007\/BF01530784","volume":"12","author":"T. Przymusinski","year":"1994","unstructured":"Teodor Przymusinski. Well-founded and stationary models of logic programs. Annals of Mathematics and Artificial Intelligence, 12:141\u2013187, 1994.","journal-title":"Annals of Mathematics and Artificial Intelligence"},{"key":"10_CR13","unstructured":"Allen Van Gelder, Kenneth Ross, and John Schlipf. The well-founded semantics for general logic programs. Journal of ACM, pages 221\u2013230, 1990."}],"container-title":["Lecture Notes in Computer Science","Logic Programming and Nonmonotonic Reasoning"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-59487-6_10.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,4,20]],"date-time":"2024-04-20T16:31:55Z","timestamp":1713630715000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-59487-6_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1995]]},"ISBN":["9783540594871","9783540492825"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/3-540-59487-6_10","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1995]]}}}