{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T23:17:26Z","timestamp":1725664646450},"publisher-location":"Berlin, Heidelberg","reference-count":19,"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_22","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T17:18:37Z","timestamp":1330276717000},"page":"302-315","source":"Crossref","is-referenced-by-count":1,"title":["A transformation of propositional Prolog programs into classical logic"],"prefix":"10.1007","author":[{"given":"Robert F.","family":"St\u00e4rk","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,5,31]]},"reference":[{"key":"22_CR1","unstructured":"J. Andrews. A logical semantics for depth-first Prolog with ground negation. Technical Report CSS\/LCCR TR93-10, Centre for Systems Science, Simon Fraser University, 1993."},{"key":"22_CR2","unstructured":"K. R. Apt. Declarative programming in Prolog. In D. Miller, editor, Logic Programming \u2014 Proceedings of the 1993 International Symposium, pages 11\u201335. MIT Press, 1993."},{"issue":"1","key":"22_CR3","doi-asserted-by":"crossref","first-page":"109","DOI":"10.1006\/inco.1993.1051","volume":"106","author":"K. R. Apt","year":"1993","unstructured":"K. R. Apt and D. Pedreschi. Reasoning about termination of pure Prolog programs. Information and Computation, 106(1):109\u2013157, 1993.","journal-title":"Information and Computation"},{"key":"22_CR4","unstructured":"E. B\u00f6rger and D. Rosenzweig. A mathematical definition of full Prolog. Science of Computer Programming, 1993. To appear."},{"issue":"1","key":"22_CR5","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0743-1066(92)90037-4","volume":"12","author":"S. Cerrito","year":"1992","unstructured":"S. Cerrito. A linear axiomatization of negation as failure. J. of Logic Programming, 12(1):1\u201324, 1992.","journal-title":"J. of Logic Programming"},{"key":"22_CR6","doi-asserted-by":"crossref","first-page":"293","DOI":"10.1007\/978-1-4684-3384-5_11","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, pages 293\u2013322. Plenum Press, New York, 1978."},{"key":"22_CR7","volume-title":"PhD thesis","author":"B. Elbl","year":"1994","unstructured":"B. Elbl. Deklarative Semantik von Logikprogrammen mit PROLOGs Auswertungsstrategie. PhD thesis, Universit\u00e4t der Bundeswehr, M\u00fcnchen, Germany, 1994."},{"key":"22_CR8","doi-asserted-by":"crossref","first-page":"295","DOI":"10.1016\/S0743-1066(85)80005-4","volume":"2","author":"M. Fitting","year":"1985","unstructured":"M. Fitting. A Kripke-Kleene semantics for logic programs. J. of Logic Programming, 2:295\u2013312, 1985.","journal-title":"J. of Logic Programming"},{"key":"22_CR9","first-page":"93","volume-title":"Logic, Methodology and Philosophy of Science VIII","author":"G. J\u00e4ger","year":"1989","unstructured":"G. J\u00e4ger. Non-monotonic reasoning by axiomatic extensions. In J. E. Fenstad, I. T. Frolov, and R. Hilpinen, editors, Logic, Methodology and Philosophy of Science VIII, pages 93\u2013110, Amsterdam, 1989. North-Holland."},{"key":"22_CR10","doi-asserted-by":"crossref","unstructured":"G. J\u00e4ger and R. F. St\u00e4rk. A proof-theoretic framework for logic programming. In S. Buss, editor, Handbook of Proof Theory. 1994. In Preparation.","DOI":"10.1007\/978-3-642-58041-3_4"},{"key":"22_CR11","unstructured":"M. Kalsbeek. Gentzen systems for logic programming styles. Technical Report CT-94-12, ILLC, University of Amsterdam, 1994."},{"issue":"4","key":"22_CR12","doi-asserted-by":"crossref","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. J. of Logic Programming, 4(4):289\u2013308, 1987.","journal-title":"J. of Logic Programming"},{"issue":"4","key":"22_CR13","first-page":"367","volume":"35","author":"G. E. Mints","year":"1986","unstructured":"G. E. Mints. Complete calculus for pure Prolog. Proc. Acad. Sci. Estonian SSR, 35(4):367\u2013380, 1986. In Russian.","journal-title":"Proc. Acad. Sci. Estonian SSR"},{"issue":"1\u20133","key":"22_CR14","doi-asserted-by":"crossref","first-page":"7","DOI":"10.1016\/0168-0072(92)90065-8","volume":"56","author":"J. C. Shepherdson","year":"1992","unstructured":"J. C. Shepherdson. Mints type deductive calculi for logic programming. Annals of Pure and Applied Logic, 56(1\u20133):7\u201317, 1992.","journal-title":"Annals of Pure and Applied Logic"},{"issue":"3","key":"22_CR15","doi-asserted-by":"crossref","first-page":"249","DOI":"10.1093\/logcom\/4.3.249","volume":"4","author":"R. F. St\u00e4rk","year":"1994","unstructured":"R. F. St\u00e4rk. Input\/output dependencies of normal logic programs. J. of Logic and Computation, 4(3):249\u2013262, 1994.","journal-title":"J. of Logic and Computation"},{"key":"22_CR16","first-page":"252","volume-title":"The declarative semantics of the Prolog selection rule","author":"R. F. St\u00e4rk","year":"1994","unstructured":"R. F. St\u00e4rk. The declarative semantics of the Prolog selection rule. In Proceedings of the Ninth Annual IEEE Symposium on Logic in Computer Science, LICS '94, pages 252\u2013261, Paris, France, July 1994. IEEE Computer Society Press."},{"key":"22_CR17","unstructured":"R. F. St\u00e4rk. First-order theories for pure Prolog programs with negation. Archive for Mathematical Logic, 199? To appear."},{"issue":"4","key":"22_CR18","doi-asserted-by":"crossref","first-page":"285","DOI":"10.3233\/FI-1992-17402","volume":"17","author":"J. Benthem van","year":"1993","unstructured":"J. van Benthem. Logic as programming. Fundamenta Informaticae, 17(4):285\u2013317, 1993.","journal-title":"Fundamenta Informaticae"},{"issue":"2","key":"22_CR19","doi-asserted-by":"crossref","first-page":"161","DOI":"10.1016\/0743-1066(93)90030-K","volume":"17","author":"A. Gelder Van","year":"1993","unstructured":"A. Van Gelder and J. S. Schlipf. Commonsense axiomatizations for logic programs. J. of Logic Programming, 17(2,3,4):161\u2013195, 1993.","journal-title":"J. of Logic Programming"}],"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_22.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,6,20]],"date-time":"2023-06-20T18:52:11Z","timestamp":1687287131000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-59487-6_22"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1995]]},"ISBN":["9783540594871","9783540492825"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/3-540-59487-6_22","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1995]]}}}