{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T13:13:48Z","timestamp":1725455628542},"publisher-location":"Berlin\/Heidelberg","reference-count":13,"publisher":"Springer-Verlag","isbn-type":[{"type":"print","value":"3540557075"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/bfb0023886","type":"book-chapter","created":{"date-parts":[[2005,11,19]],"date-time":"2005-11-19T01:02:35Z","timestamp":1132362155000},"page":"326-335","source":"Crossref","is-referenced-by-count":1,"title":["Minimal negation and Hereditary Harrop formulae"],"prefix":"10.1007","author":[{"given":"Alberto","family":"Momigliano","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"29_CR1","unstructured":"Chan D. Constructive Negation Based on the Completed Database, Proc. 5th Conf. Logic Programming, Kowalski&Bowen (eds.), 1988."},{"key":"29_CR2","volume-title":"Logic and Data Bases","author":"K.L. Clark","year":"1978","unstructured":"Clark K.L. Negation as Failure in: Gallaire & Minker (eds.), Logic and Data Bases, Plenum Press, New York, 1978."},{"key":"29_CR3","doi-asserted-by":"crossref","unstructured":"Gabbay D. & Sergot M. Negations as Inconsistency: I, JLP, pp. 1\u201336, 1986.","DOI":"10.1016\/0743-1066(86)90002-6"},{"key":"29_CR4","first-page":"119","volume":"4","author":"I. Johansonn","year":"1936","unstructured":"Johansonn I. Der MinimalKalk\u00fcl, ein reduzierter intuitioniticher Formalismus, Compositio Mathmatica, vol. 4, pp. 119\u2013136, 1936.","journal-title":"Compositio Mathmatica"},{"key":"29_CR5","unstructured":"Harland J. On Hereditary Harrop Formulae as a Basis for Logic Programming, PhD Thesis, Edinburgh 1991."},{"key":"29_CR6","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":"Lloyd J.W. Foundations of Logic Programming, Second Extended Edition, Springer-Verlag, Berlin, 1987.","edition":"Second Extended"},{"key":"29_CR7","doi-asserted-by":"crossref","unstructured":"Miller D. A Logical Analysis of Modules in Logic Programming, JLP, pp. 79\u2013108, 1989.","DOI":"10.1016\/0743-1066(89)90031-9"},{"key":"29_CR8","unstructured":"Miller D. & Nadathur G. & Pfenning F. & Scedrov A. Uniform Proofs as a Foundation for Logic Programming, to appear in The Annals of Pure and Applied Logic"},{"key":"29_CR9","unstructured":"Pfenning F. Notes on Logic Programming, unpublished, 1991."},{"key":"29_CR10","volume-title":"Natural Deduction","author":"D. Prawitz","year":"1965","unstructured":"Prawitz D. Natural Deduction, Almqvist&Wiksell, Stockholm 1965."},{"key":"29_CR11","doi-asserted-by":"crossref","unstructured":"Shepherdson J.C. Negation in Logic Programming in: Foundations of Deductive Databases and Logic Programming Minker J. (ed.) Morgan Kaufmann, 1988.","DOI":"10.1016\/B978-0-934613-40-8.50005-1"},{"key":"29_CR12","unstructured":"Sterling L. & Shapiro E. The Art of Prolog, MIT Press, 1986."},{"key":"29_CR13","volume-title":"Constructivism in Mathematics, vol 1","author":"A.S. Troesltra","year":"1988","unstructured":"Troesltra A.S. & van Dalen D. Constructivism in Mathematics, vol 1. North-Holland, Amsterdam 1988."}],"container-title":["Lecture Notes in Computer Science","Logical Foundations of Computer Science \u2014 Tver '92"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0023886.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,12,9]],"date-time":"2020-12-09T16:51:04Z","timestamp":1607532664000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0023886"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["3540557075"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/bfb0023886","relation":{},"subject":[]}}