{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T23:04:27Z","timestamp":1725663867077},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540527534"},{"type":"electronic","value":"9783540471370"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1990]]},"DOI":"10.1007\/3-540-52753-2_53","type":"book-chapter","created":{"date-parts":[[2012,2,25]],"date-time":"2012-02-25T21:42:30Z","timestamp":1330206150000},"page":"384-395","source":"Crossref","is-referenced-by-count":1,"title":["A quantifier-free completion of logic programs"],"prefix":"10.1007","author":[{"given":"Robert F.","family":"St\u00e4rk","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,6,8]]},"reference":[{"key":"25_CR1","unstructured":"A. Avron. Foundations and proof theory of 3-valued logics. LFCS Report 88-48, University of Edinburgh, Apr. 1988."},{"key":"25_CR2","unstructured":"L. Cavedon and J. W. Lloyd. A completeness theorem for sldnf-resolution. Technical Report 87\/9, University of Melbourne, 1987."},{"key":"25_CR3","unstructured":"S. Cerrito. Negation as failure \u2014 a linear axiomatization. Technical Report 434, Universit\u00e9 Paris X, 1988."},{"key":"25_CR4","volume-title":"Logic and Data Bases","author":"K. L. Clark","year":"1978","unstructured":"K. L. Clark. Negation as failure. In H. Gallaire and J. Minker, editors, Logic and Data Bases. Plenum Press, New York, 1978."},{"key":"25_CR5","volume-title":"Proof Theory and Logical Complexitiy","author":"J.-Y. Girard","year":"1987","unstructured":"J.-Y. Girard. Proof Theory and Logical Complexitiy. Bibliopolis, Napoli, 1987."},{"issue":"43","key":"25_CR6","doi-asserted-by":"crossref","first-page":"99","DOI":"10.1016\/0168-0072(80)90001-9","volume":"2","author":"H. Hodes","year":"1989","unstructured":"H. Hodes. Three-valued logics: An introduction, a comparison of various logical lexica, and some philosophical remarks. Annals of Pure and Applied Logic, 2(43):99\u2013145, 1989.","journal-title":"Annals of Pure and Applied Logic"},{"key":"25_CR7","unstructured":"G. J\u00e4ger. Proofs as advanced and powerful tools. In Proceedings of the XI IFIP Congress, 1989."},{"issue":"4","key":"25_CR8","doi-asserted-by":"publisher","first-page":"289","DOI":"10.1016\/0743-1066(87)90007-0","volume":"4","author":"K. Kunen","year":"1987","unstructured":"K. Kunen. Negation in logic programming. Journal of Logic Programming, 4(4):289\u2013308, 1987.","journal-title":"Journal of Logic Programming"},{"key":"25_CR9","unstructured":"K. Kunen. Signed data dependencies in logic programs. Technical Report 719, University of Wisconsin-Madison, Oct. 1987."},{"key":"25_CR10","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-83189-8","volume-title":"Foundations of Logic Programming","author":"J. W. Lloyd","year":"1987","unstructured":"J. W. Lloyd. Foundations of Logic Programming. Springer-Verlag, Berlin, second edition, 1987.","edition":"second edition"},{"key":"25_CR11","doi-asserted-by":"crossref","unstructured":"K. Sch\u00fctte. Vollst\u00e4ndige Systeme modaler und intuitionistischer Logik. Springer-Verlag, 1968.","DOI":"10.1007\/978-3-642-88664-5"},{"key":"25_CR12","volume-title":"Foundations of Deductive Databases and Logic Programming","author":"J. C. Shepherdson","year":"1987","unstructured":"J. C. Shepherdson. Negation in logic programming. In J. Minker, editor, Foundations of Deductive Databases and Logic Programming. Morgan Kaufmann, Los Altos, 1987."},{"issue":"3","key":"25_CR13","doi-asserted-by":"publisher","first-page":"343","DOI":"10.1016\/0304-3975(89)90106-0","volume":"65","author":"J. C. Shepherdson","year":"1989","unstructured":"J. C. Shepherdson. A sound and complete semantics for a version of negation as failure. Theoretical Computer Science, 65(3):343\u2013371, 1989.","journal-title":"Theoretical Computer Science"},{"key":"25_CR14","volume-title":"Proof Theory","author":"G. Takeuti","year":"1987","unstructured":"G. Takeuti. Proof Theory. North-Holland, Amsterdam, 1987."}],"container-title":["Lecture Notes in Computer Science","CSL '89"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-52753-2_53.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T21:25:13Z","timestamp":1605648313000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-52753-2_53"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1990]]},"ISBN":["9783540527534","9783540471370"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/3-540-52753-2_53","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1990]]}}}