{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,11]],"date-time":"2025-07-11T10:51:24Z","timestamp":1752231084955},"publisher-location":"Berlin, Heidelberg","reference-count":21,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540584957"},{"type":"electronic","value":"9783540490104"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1994]]},"DOI":"10.1007\/3-540-58495-1_32","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T11:32:14Z","timestamp":1330255934000},"page":"315-325","source":"Crossref","is-referenced-by-count":4,"title":["Towards refinement of definite logic programs"],"prefix":"10.1007","author":[{"given":"Jan","family":"Komorowski","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Silvia","family":"Trcek","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,6,9]]},"reference":[{"key":"32_CR1","doi-asserted-by":"crossref","first-page":"593","DOI":"10.1007\/BF00291051","volume":"25","author":"R. J. R. Back","year":"1988","unstructured":"R. J. R. Back. A calculus of refinements for program derivations. Acta Informatica, 25:593\u2013624, 1988.","journal-title":"Acta Informatica"},{"key":"32_CR2","doi-asserted-by":"crossref","first-page":"47","DOI":"10.1016\/0743-1066(93)90023-A","volume":"16","author":"A. Bossi","year":"1993","unstructured":"A. Bossi and N. Cocco. Basic transformation operations for logic programs which preserve computed answer substitutions of logic programs. Journal of Logic Programming, 16:47\u201387, 1993.","journal-title":"Journal of Logic Programming"},{"key":"32_CR3","unstructured":"K. Clark and S.-A. T\u00e4rnlund. A first-order theory of data and programs. In Proc. of the International Joint Conference on Artificial Intelligence, pages 419\u2013420, 1977."},{"key":"32_CR4","unstructured":"W. Drabent, S. Nadjm-Tehrani, and J. Ma\u0142uszy\u0144ski. The use of assertions in algorithmic debugging. In ICOT, editor, Proceedings of the International Conference on Fifth Generation Computer Systems, pages 573\u2013581, 1988."},{"issue":"1","key":"32_CR5","doi-asserted-by":"crossref","first-page":"86","DOI":"10.1006\/inco.1993.1015","volume":"102","author":"M. Falaschi","year":"1993","unstructured":"M. Falaschi, G. Levi, M. Martelli, and C. Palamidessi. A model-theoretic reconstruction of the operational semantics of logic programs. Information and Computation, 102(1):86\u2013113, 1993.","journal-title":"Information and Computation"},{"key":"32_CR6","first-page":"109","volume-title":"Transforming logic programs by specialising interpreters","author":"J. Gallagher","year":"1986","unstructured":"J. Gallagher. Transforming logic programs by specialising interpreters. In ECAI-86. 7th European Conference on Artificial Intelligence, Brighton Centre, United Kingdom, pages 109\u2013122, 1986."},{"key":"32_CR7","volume-title":"PhD thesis","author":"J. Komorowski","year":"1981","unstructured":"J. Komorowski. A Specification of An Abstract Prolog Machine and Its Application to Partial Evaluation. PhD thesis, Department of Computer and Information Science, Link\u00f6ping University, Link\u00f6ping, 1981."},{"key":"32_CR8","doi-asserted-by":"crossref","unstructured":"J. Komorowski. Partial evaluation as a means for inferencing data structures in an applicative language: a theory and implementation in the case of Prolog. In Proc. of the ACM Symp. Principles of Programming Languages, pages 255\u2013267. ACM, 1982.","DOI":"10.1145\/582153.582181"},{"key":"32_CR9","volume-title":"Elements of a programming methodology founded on partial deduction \u2014 part 1","author":"J. Komorowski","year":"1990","unstructured":"J. Komorowski. Elements of a programming methodology founded on partial deduction \u2014 part 1. In Z. Ras, editor, Proc. of the Int. Symp. on Methodologies for Intelligent Systems. North Holland, October 1990. Knoxville, Tennessee."},{"key":"32_CR10","unstructured":"J. Komorowski. Towards a programming methodology founded on partial deduction. In Proc. of the European Conference on Artificial Intelligence. Pitman Publ. Co., August 1990."},{"key":"32_CR11","doi-asserted-by":"crossref","unstructured":"J. Komorowski. An introduction to partial deduction. In Proc. of the META'92 Workshop on Meta Programming. Lecture Notes in Computer Science, 1992.","DOI":"10.1007\/3-540-56282-6_4"},{"key":"32_CR12","unstructured":"J. Komorowski. On data-type centered, correctness-oriented design. In J. Jacquet, editor, Constructing Logic Programs. John Wiley & Sons, 1993."},{"issue":"1","key":"32_CR13","doi-asserted-by":"crossref","first-page":"41","DOI":"10.3233\/FI-1993-18104","volume":"18","author":"J. Komorowski","year":"1993","unstructured":"J. Komorowski. A prolegomenon to partial deduction. Fundamenta Informaticae, 18(1):41\u201364, January 1993.","journal-title":"Fundamenta Informaticae"},{"key":"32_CR14","doi-asserted-by":"crossref","unstructured":"J. Komorowski. Special issue on partial deduction. Journal of Logic Programming, 16, 1993. Guest Editor.","DOI":"10.1016\/0743-1066(93)90020-H"},{"key":"32_CR15","unstructured":"J. Komorowski. PAL \u2014 a programming environment for the refinement calculus. Technical report, The Norwegian Institute of Technology, 1994."},{"key":"32_CR16","volume-title":"On refinement of logic programs","author":"J. Komorowski","year":"1993","unstructured":"J. Komorowski and S. Trcek. On refinement of logic programs. In Proc. of the 5th Nordic Workshop on Program Correctness, Turku, Finland \u00e5bo Akademi University, 1993."},{"key":"32_CR17","unstructured":"A. Lakhotia. Incorporating\u2019 programming techniques\u2019 into Prolog Programs. In E. Lusk and R. A. Overbeek, editors, Proc. of the North American Conference on Logic Programming, pages 426\u2013440. MIT Press, 1989."},{"key":"32_CR18","unstructured":"K.-K. Lau and S. Prestwich. Synthesis of a family of recursive sorting procedures. In Proc. of the International Conference on Logic Programming, pages 641\u2013658. MIT Press, 1991."},{"key":"32_CR19","volume-title":"Decidability results and characterization of strategies for the development of logic programs","author":"A. Pettorossi","year":"1989","unstructured":"A. Pettorossi and M. Proietti. Decidability results and characterization of strategies for the development of logic programs. In Proc. of the International Conf. on Logic Programming, Lisabon, Portugal, 1989. MIT Press."},{"key":"32_CR20","doi-asserted-by":"crossref","first-page":"605","DOI":"10.1016\/S0747-7171(89)80064-1","volume":"8","author":"T. Sato","year":"1989","unstructured":"T. Sato and H. Tamaki. First-order compiler: A deterministic logic program synthesis algorithm. J. Symbolic Computation, 8:605\u2013627, 1989.","journal-title":"J. Symbolic Computation"},{"key":"32_CR21","doi-asserted-by":"crossref","unstructured":"D. S. Warren. Memoing for logic programs. In Special Issue of the CACM on Logic Programming. ACM, March 1992.","DOI":"10.1145\/131295.131299"}],"container-title":["Lecture Notes in Computer Science","Methodologies for Intelligent Systems"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-58495-1_32.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,12,31]],"date-time":"2021-12-31T03:02:09Z","timestamp":1640919729000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-58495-1_32"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1994]]},"ISBN":["9783540584957","9783540490104"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/3-540-58495-1_32","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1994]]}}}