{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,15]],"date-time":"2026-01-15T05:30:04Z","timestamp":1768455004918,"version":"3.49.0"},"publisher-location":"Berlin, Heidelberg","reference-count":19,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540609834","type":"print"},{"value":"9783540497516","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1996]]},"DOI":"10.1007\/3-540-60983-0_17","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T21:09:53Z","timestamp":1330290593000},"page":"237-254","source":"Crossref","is-referenced-by-count":2,"title":["Total correctness of logic programs: A formal approach"],"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,2]]},"reference":[{"key":"17_CR1","unstructured":"J. Andrews. A paralogical semantics for the Prolog cut. In J. Lloyd, editor, Logic Programming \u2014 Proceedings of the 1995 International Symposium, pages 591\u2013605. MIT Press, 1995."},{"key":"17_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":"6A","key":"17_CR3","doi-asserted-by":"crossref","first-page":"743","DOI":"10.1007\/BF01213601","volume":"6","author":"K. R. Apt","year":"1994","unstructured":"K. R. Apt and E. Marchiori. Reasoning about Prolog programs: from modes through types to assertions. Formal Aspects of Computing, 6(6A):743\u2013765, 1994.","journal-title":"Formal Aspects of Computing"},{"issue":"1","key":"17_CR4","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":"17_CR5","doi-asserted-by":"crossref","first-page":"183","DOI":"10.1093\/oso\/9780198538530.003.0004","volume-title":"Advances in Logic Programming Theory","author":"K. R. Apt","year":"1994","unstructured":"K. R. Apt and D. Pedreschi. Modular termination proofs for logic and pure Prolog programs. In G. Levi, editor, Advances in Logic Programming Theory, pages 183\u2013229. Clarendon Press, Oxford, 1994."},{"key":"17_CR6","first-page":"336","volume-title":"Proving termination properties of Prolog programs: a semantic approach","author":"M. Baudinet","year":"1988","unstructured":"M. Baudinet. Proving termination properties of Prolog programs: a semantic approach. In Proceedings of the Third Annual IEEE Symposium on Logic in Computer Science, LICS '88, pages 336\u2013347, Edinburgh, Scotland, 1988. IEEE Computer Society Press."},{"key":"17_CR7","unstructured":"F. Bronsard, T. K. Lakshman, and U. S. Reddy. A framework of directionality for proving termination of logic programs. In K. R. Apt, editor, Proceedings of the Joint International Conference and Symposium on Logic Programming, pages 321\u2013335. MIT Press, 1992."},{"key":"17_CR8","doi-asserted-by":"crossref","unstructured":"H. Coelho and J. C. Cotta. Prolog by Example. Springer-Verlag, 1988.","DOI":"10.1007\/978-3-642-83213-0"},{"key":"17_CR9","unstructured":"L. Colussi and E. Marchiori. Proving correctness of logic programs using axiomatic semantics. In K. Furukawa, editor, Logic Programming. Proceedings of the Eighth International Conference, pages 629\u2013642. MIT Press, 1991."},{"key":"17_CR10","doi-asserted-by":"crossref","unstructured":"P. Deransart and J. Malusy\u0144ski. A Grammatical View of Logic Programming. MIT Press, 1993.","DOI":"10.7551\/mitpress\/3345.001.0001"},{"key":"17_CR11","doi-asserted-by":"crossref","first-page":"167","DOI":"10.1007\/BFb0014980","volume":"250","author":"W. Drabent","year":"1987","unstructured":"W. Drabent and J. Maluszy\u0144ski. Inductive assertion method for logic programs. In TAPSOFT '87. Proceedings of the International Joint Conference on Theory and Practice in Software Development, pages 167\u2013181. Springer-Verlag, Lecture Notes in Computer Science 250, 1987.","journal-title":"Springer-Verlag, Lecture Notes in Computer Science"},{"key":"17_CR12","doi-asserted-by":"crossref","unstructured":"S. Feferman. Definedness. Technical report, Department of Mathematics, Stanford University, 1995.","DOI":"10.1007\/BF01135376"},{"key":"17_CR13","first-page":"133","volume-title":"Proof and Computation","author":"G. J\u00e4ger","year":"1993","unstructured":"G. J\u00e4ger. A deductive approach to logic programming. In H. Schwichtenberg, editor, Proof and Computation, pages 133\u2013172. NATO Advanced Study Institute, Marktoberdorf, Germany, 1993, Springer-Verlag, 1995."},{"key":"17_CR14","unstructured":"R. F. St\u00e4rk. From logic programs to inductive definitions. In W. A. Hodges, editor, Logic Colloquium '93. Oxford University Press, 199? To appear."},{"key":"17_CR15","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."},{"issue":"2","key":"17_CR16","doi-asserted-by":"crossref","first-page":"113","DOI":"10.1007\/BF01270391","volume":"34","author":"R. F. St\u00e4rk","year":"1995","unstructured":"R. F. St\u00e4rk. First-order theories for pure Prolog programs with negation. Archive for Mathematical Logic, 34(2):113\u2013144, 1995.","journal-title":"Archive for Mathematical Logic"},{"key":"17_CR17","first-page":"302","volume-title":"Lecture Notes in Artificial Intelligence 928","author":"R. F. St\u00e4rk","year":"1995","unstructured":"R. F. St\u00e4rk. A transformation of prepositional Prolog programs into classical logic. In V. W. Marek, A. Nerode, and M. Truszczy\u0144ski, editors, Proceedings of the Third International Conference on Logic Programming and Nonmonotonic Reasoning, LPNMR '95, pages 302\u2013315, Lexington, Kentucky, 1995. Springer-Verlag, Lecture Notes in Artificial Intelligence 928."},{"key":"17_CR18","volume-title":"Technical report","author":"K. Stroetmann","year":"1995","unstructured":"K. Stroetmann and T. Glass. Augmented Prolog \u2014 an evolutionary approach. Technical report, Siemens AG, Corporate Research and Development, Munich, 1995."},{"issue":"2","key":"17_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","Extensions of Logic Programming"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-60983-0_17.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,3,21]],"date-time":"2025-03-21T23:12:24Z","timestamp":1742598744000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-60983-0_17"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1996]]},"ISBN":["9783540609834","9783540497516"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/3-540-60983-0_17","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[1996]]}}}