{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T22:02:46Z","timestamp":1725487366883},"publisher-location":"Berlin, Heidelberg","reference-count":28,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540404385"},{"type":"electronic","value":"9783540450139"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2003]]},"DOI":"10.1007\/3-540-45013-0_18","type":"book-chapter","created":{"date-parts":[[2007,7,16]],"date-time":"2007-07-16T16:06:29Z","timestamp":1184601989000},"page":"238-257","source":"Crossref","is-referenced-by-count":0,"title":["A Fixed Point Semantics for Logic Programs Extended with Cuts"],"prefix":"10.1007","author":[{"given":"Wim","family":"Vanhoof","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Remko","family":"Tron\u00e7on","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Maurice","family":"Bruynooghe","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2003,6,24]]},"reference":[{"doi-asserted-by":"crossref","unstructured":"K. R. Apt. Logic programming. In J. van Leeuwen, editor, Handbook of Theoretical Computer Science, Volume B, Formal Models and Semantics, pages 493\u2013574. Elsevier Science Publishers B.V., 1990.","key":"18_CR1","DOI":"10.1016\/B978-0-444-88074-1.50015-9"},{"issue":"6","key":"18_CR2","doi-asserted-by":"publisher","first-page":"579","DOI":"10.1093\/logcom\/3.6.579","volume":"3","author":"R. Barbuti","year":"1993","unstructured":"Roberto Barbuti, Michael Codish, Roberto Giacobazzi, and Giorgio Levi. Modelling Prolog control. Journal of Logic and Computation, 3(6):579\u2013603, December 1993.","journal-title":"Journal of Logic and Computation"},{"issue":"1","key":"18_CR3","doi-asserted-by":"publisher","first-page":"133","DOI":"10.1145\/151646.151650","volume":"15","author":"R. Barbuti","year":"1993","unstructured":"Roberto Barbuti, Roberto Giacobazzi, and Giorgio Levi. A General Framework for Semantics-Based Bottom-Up Abstract Interpretation of Logic Programs. ACM TOPLAS, 15(1):133\u2013181, January 1993.","journal-title":"ACM TOPLAS"},{"issue":"1 & 2","key":"18_CR4","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/0743-1066(92)90045-5","volume":"14","author":"M. Baudinet","year":"1992","unstructured":"Marianne Baudinet. Proving termination of Prolog programs: A semantic approach. Journal of Logic Programming, 14(1 & 2):1\u201329, 1992.","journal-title":"Journal of Logic Programming"},{"key":"18_CR5","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1016\/0743-1066(94)90026-4","volume":"19\/20","author":"A. Bossi","year":"1994","unstructured":"A. Bossi, M. Gabbrielli, G. Levi, and M. Martelli. The s-semantics approach: Theory and applications. Journal of Logic Programming, 19\/20:149\u2013197, 1994.","journal-title":"Journal of Logic Programming"},{"issue":"1\u20132","key":"18_CR6","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1016\/0304-3975(94)90200-3","volume":"122","author":"A. Bossi","year":"1994","unstructured":"A. Bossi, M. Gabbrielli, G. Levi, and M. C. Meo. A compositional semantics for logic programs. Theoretical Computer Science, 122(1\u20132):3\u201347, 1994.","journal-title":"Theoretical Computer Science"},{"unstructured":"M. Bugliesi and F. Russo. Partial evaluation in Prolog: Some improvements about cut. In Ewing L. Lusk and Ross A. Overbeek, editors, Proceedings of the North American Conference on Logic Programming, pages 645\u2013660, Cleveland, Ohio, USA, 1989.","key":"18_CR7"},{"issue":"1","key":"18_CR8","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1017\/S1471068402001114","volume":"2","author":"B. Charlier Le","year":"2002","unstructured":"Baudouin Le Charlier, Sabina Rossi, and Pascal Van Hentenryck. Sequence-based abstract interpretation of Prolog. Theory and Practice of Logic Programming, 2(1):25\u201384, 2002.","journal-title":"Theory and Practice of Logic Programming"},{"issue":"1","key":"18_CR9","doi-asserted-by":"publisher","first-page":"93","DOI":"10.1016\/0304-3975(94)90055-8","volume":"124","author":"M. Codish","year":"1994","unstructured":"M. Codish, D. Dams, and E. Yardeni. Bottom-Up Abstract Interpretation of Logic Programs. Theoretical Computer Science, 124(1):93\u2013125, February 1994.","journal-title":"Theoretical Computer Science"},{"issue":"1 & 2","key":"18_CR10","doi-asserted-by":"publisher","first-page":"275","DOI":"10.1016\/S0304-3975(97)00174-6","volume":"211","author":"M. Comini","year":"1999","unstructured":"Marco Comini and Maria Chiara Meo. Compositionality properties of SLD-derivations. Theoretical Computer Science, 211(1 & 2):275\u2013309, January 1999.","journal-title":"Theoretical Computer Science"},{"issue":"1","key":"18_CR11","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1016\/0743-1066(88)90007-6","volume":"5","author":"S. K. Debray","year":"1988","unstructured":"S. K. Debray and P. Mishra. Denotational and operational semantics for Prolog. Journal of Logic Programming, 5(1):61\u201391, 1988.","journal-title":"Journal of Logic Programming"},{"key":"18_CR12","doi-asserted-by":"publisher","first-page":"289","DOI":"10.1016\/0304-3975(89)90070-4","volume":"69","author":"M. Falaschi","year":"1989","unstructured":"M. Falaschi, G. Levi, M. Martelli, and C. Palamidessi. Declarative modeling of the operational behaviour of logic programs. Theoretical Computer Science, 69:289\u2013318, 1989.","journal-title":"Theoretical Computer Science"},{"doi-asserted-by":"crossref","unstructured":"G. Fil\u00e8 and S. Rossi. Static analysis of Prolog with cut. In A. Voronkov, editor, Proceedings of the 4th International Conference on Logic Programmng and Automated Reasoning, pages 134\u2013145, 1993. Springer-Verlag.","key":"18_CR13","DOI":"10.1007\/3-540-56944-8_48"},{"unstructured":"N. D. Jones, C. K. Gomard, and P. Sestoft. Partial Evaluation and Automatic Program Generation. Prentice Hall, 1993.","key":"18_CR14"},{"key":"18_CR15","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"137","DOI":"10.1007\/3-540-61756-6_82","volume-title":"Proceedings of the International Symposium on Programming H Languages, Implementations, Logics and Programs (PLILP\u201996)","author":"M. Leuschel","year":"1996","unstructured":"M. Leuschel and D. De Schreye. Logic program specialisation: How to be more specific. In H. Kuchen and S. Swierstra, editors, Proceedings of the International Symposium on Programming H Languages, Implementations, Logics and Programs (PLILP\u201996), pages 137\u2013151, Aachen, Germany, 1996. Springer-Verlag. LNCS 1140."},{"doi-asserted-by":"crossref","unstructured":"Michael Leuschel. Partial evaluation of the \u201creal thing\u201d. In Logic Program Synthesis and Transformation. Proceedings of LOPSTR\u201994, Pisa, Italy, 1994.","key":"18_CR16","DOI":"10.1007\/3-540-58792-6_8"},{"unstructured":"Michael Leuschel. Program specialisation and abstract interpretation reconciled. In Joxan Jaffar, editor, Proceedings of the Joint International Conference and Symposium on Logic Programming (JICSLP\u201998), pages 220\u2013234, Manchester, UK, 1998. MIT Press.","key":"18_CR17"},{"doi-asserted-by":"crossref","unstructured":"J. W. Lloyd. Foundations of Logic Programming. Springer-Verlag, 1987.","key":"18_CR18","DOI":"10.1007\/978-3-642-83189-8"},{"unstructured":"K. Marriott, L. Naish, and J.-L. Lassez. Most specific logic programs. In Robert A. Kowalski and Kenneth A. Bowen, editors, Proceedings of the Fifth International Conference and Symposium on Logic Programming, pages 909\u2013923, Seattle, 1988. ALP, IEEE, The MIT Press.","key":"18_CR19"},{"unstructured":"R. A. O\u2019Keefe. On the treatment of cuts in Prolog source-level tools. In Proceedings of the International Symposium on Logic Programming, pages 68\u201372. IEEE Computer Society, Technical Committee on Computer Languages, The Computer Society Press, July 1985.","key":"18_CR20"},{"doi-asserted-by":"crossref","unstructured":"S. Prestwich. An unfold rule for full Prolog. In Kung-Kiu Lau and Tim Clement, editors, Proceedings of the International Workshop on Logic Program Synthesis and Transformation, Workshops in Computing, pages 199\u2013213, London, July 2\u20133 1993. Springer Verlag.","key":"18_CR21","DOI":"10.1007\/978-1-4471-3560-9_14"},{"issue":"N. 9","key":"18_CR22","doi-asserted-by":"publisher","first-page":"274","DOI":"10.1145\/115866.115895","volume":"26","author":"M. Proietti","year":"1991","unstructured":"M. Proietti and A. Pettorossi. Semantics preserving transformation rules for Prolog. In Proceedings of PEPM\u201991, Sigplan Notices, Vol. 26, N. 9, pages 274\u2013284, 1991.","journal-title":"Sigplan Notices"},{"issue":"1","key":"18_CR23","doi-asserted-by":"publisher","first-page":"7","DOI":"10.1007\/BF03038271","volume":"12","author":"D. Sahlin","year":"1993","unstructured":"D. Sahlin. Mixtus: An automatic partial evaluator for full prolog. New Generation Computing, 12(1): 7\u201351, 1993.","journal-title":"New Generation Computing"},{"issue":"1","key":"18_CR24","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/S0743-1066(99)00012-6","volume":"42","author":"F. Spoto","year":"2000","unstructured":"F. Spoto. Operational and goal-independent denotational semantics for Prolog with cut. Journal of Logic Programming, 42(1):1\u201346, 2000.","journal-title":"Journal of Logic Programming"},{"issue":"1\u20132","key":"18_CR25","doi-asserted-by":"publisher","first-page":"277","DOI":"10.1016\/0004-3702(95)00122-0","volume":"85","author":"A. Srinivasan","year":"1996","unstructured":"Ashwin Srinivasan, Stephen Muggleton, Michael J. E. Sternberg, and Ross D. King. Theories for mutagenicity: A study in first-order and feature-based induction. Artificial Intelligence, 85(1\u20132):277\u2013299, 1996.","journal-title":"Artificial Intelligence"},{"issue":"4","key":"18_CR26","doi-asserted-by":"publisher","first-page":"733","DOI":"10.1145\/321978.321991","volume":"23","author":"M. H. Emden van","year":"1976","unstructured":"M. H. van Emden and R. Kowalski. The Semantics of Predicate Logic as Programming Language. Journal of ACM, 23(4):733\u2013743, 1976.","journal-title":"Journal of ACM"},{"key":"18_CR27","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"54","DOI":"10.1007\/BFb0056607","volume-title":"Proceedings of the Joint International Symposia PLILP\/ALP 1998","author":"W. Vanhoof","year":"1998","unstructured":"W. Vanhoof, D. De Schreye, and B. Martens. A framework for bottom up specialisation of logic programs. In C. Palamidessi, H. Glaser, and K. Meinke, editors, Proceedings of the Joint International Symposia PLILP\/ALP 1998, volume 1490 of Lecture Notes In Computer Science, pages 54\u201372. Springer-Verlag, 1998."},{"key":"18_CR28","first-page":"1","volume":"1999","author":"W. Vanhoof","year":"1999","unstructured":"W. Vanhoof, D. De Schreye, and B. Martens. Bottom-up partial deduction of logic programs. The Journal of Functional and Logic Programming, 1999:1\u201333, 1999.","journal-title":"The Journal of Functional and Logic Programming"}],"container-title":["Lecture Notes in Computer Science","Logic Based Program Synthesis and Transformation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-45013-0_18","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,1]],"date-time":"2019-05-01T03:21:46Z","timestamp":1556680906000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-45013-0_18"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003]]},"ISBN":["9783540404385","9783540450139"],"references-count":28,"URL":"https:\/\/doi.org\/10.1007\/3-540-45013-0_18","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2003]]}}}