{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T23:17:16Z","timestamp":1725664636558},"publisher-location":"Berlin, Heidelberg","reference-count":20,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540609391"},{"type":"electronic","value":"9783540497455"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1996]]},"DOI":"10.1007\/3-540-60939-3_17","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T21:07:19Z","timestamp":1330290439000},"page":"219-233","source":"Crossref","is-referenced-by-count":11,"title":["Termination of logic programs using semantic unification"],"prefix":"10.1007","author":[{"given":"Thomas","family":"Arts","sequence":"first","affiliation":[]},{"given":"Hans","family":"Zantema","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,6,1]]},"reference":[{"key":"17_CR1","first-page":"114","volume":"761","author":"G. Aguzzi","year":"1993","unstructured":"G. Aguzzi and U. Modigliani. Proving termination of logic programs by transforming them into equivalent term rewriting systems. Proceedings of FST&TCS 13, LNCS(761):114\u2013124, December 1993.","journal-title":"LNCS"},{"doi-asserted-by":"crossref","unstructured":"Thomas Arts. Termination by absence of infinite chains of dependency pairs. In Proceedings of CAAP'96, April 1996. Full version appeared as technical report UU-CS-1995-32, Utrecht University.","key":"17_CR2","DOI":"10.1007\/3-540-61064-2_38"},{"unstructured":"Thomas Arts and Hans Zantema. Termination of logic programs via labelled term rewrite systems. Technical Report UU-CS-1994-20, Utrecht University.","key":"17_CR3"},{"unstructured":"Thomas Arts and Hans Zantema. Termination of constructor systems using semantic unification. Technical Report UU-CS-1995-17, Utrecht University.","key":"17_CR4"},{"unstructured":"Maher Chtourou and Micha\u00ebl Rusinowitch. M\u00e9thode transformationnelle pour la preuve de terminaison des programmes logiques. Unpublished manuscript in French, 1993.","key":"17_CR5"},{"issue":"1","key":"17_CR6","doi-asserted-by":"crossref","first-page":"69","DOI":"10.1016\/S0747-7171(87)80022-6","volume":"3","author":"N. Dershowitz","year":"1987","unstructured":"N. Dershowitz. Termination of rewriting. Journal of Symbolic Computation, 3(1):69\u2013116, 1987.","journal-title":"Journal of Symbolic Computation"},{"doi-asserted-by":"crossref","unstructured":"N. Dershowitz and J.-P. Jouannaud. Rewrite systems. In J. van Leeuwen, editor, Handbook of Theoretical Computer Science, volume B, pages 243\u2013320. North-Holland, 1990.","key":"17_CR7","DOI":"10.1016\/B978-0-444-88074-1.50011-1"},{"unstructured":"P. Dembinski and J. Maluszynski. And-parallelism with intelligent backtracking for annotated logic programs. Proceedings of the International Symposium on Logic Programming, pages 29\u201338, 1985.","key":"17_CR8"},{"key":"17_CR9","first-page":"204","volume":"850","author":"M. Ferreira","year":"1994","unstructured":"Maria Ferreira and Hans Zantema. Syntactical analysis of total termination. Proceedings of ALP'94, LNCS(850):204\u2013222, September 1994.","journal-title":"Proceedings of ALP'94, LNCS"},{"key":"17_CR10","first-page":"430","volume":"656","author":"H. Ganzinger","year":"1992","unstructured":"Harald Ganzinger and Uwe Waldmann. Termination proofs of well-moded logic programs via conditional rewrite systems. Proceedings of CTRS, LNCS(656):430\u2013437, July 1992.","journal-title":"LNCS"},{"key":"17_CR11","doi-asserted-by":"crossref","first-page":"583","DOI":"10.1016\/0743-1066(94)90034-5","volume":"19\u201320","author":"M. Hanus","year":"1994","unstructured":"M. Hanus. The intergration of functions into logic programming: From theory to practice. Journal of Logic Programming, 19\u201320:583\u2013628, 1994.","journal-title":"Journal of Logic Programming"},{"doi-asserted-by":"crossref","unstructured":"S. H\u00f6lldobler. Foundations of Equational Logic Programming, volume 353 of LNAI, 1989. Subseries of LNCS.","key":"17_CR12","DOI":"10.1007\/BFb0015791"},{"key":"17_CR13","first-page":"318","volume":"87","author":"J.M. Hullot","year":"1980","unstructured":"J.M. Hullot. Canonical forms and unification. 5th International Conference on Automated Deduction, LNCS(87):318\u2013334, 1980.","journal-title":"LNCS"},{"key":"17_CR14","first-page":"213","volume":"626","author":"M. K. Rao","year":"1991","unstructured":"M.R.K. Krishna Rao, Deepak Kapur, and R.K. Shyamasundar. A transformational methodology for proving termination of logic programs. Proceedings of CSL, LNCS(626):213\u2013226, 1991.","journal-title":"LNCS"},{"key":"17_CR15","first-page":"1","volume-title":"Handbook of Logic in Computer Science, volume 2","author":"J.W. Klop","year":"1992","unstructured":"J.W. Klop. Term rewriting systems. In S. Abramsky, D.M. Gabbay, and T.S.E. Maibaum, editors, Handbook of Logic in Computer Science, volume 2, pages 1\u2013116. Oxford University Press, New York, 1992."},{"key":"17_CR16","first-page":"223","volume":"850","author":"M. Marchiori","year":"1994","unstructured":"Massimo Marchiori. Logic programs as term rewrite systems. Proceedings of ALP'94, LNCS(850):223\u2013241, September 1994.","journal-title":"LNCS"},{"issue":"20","key":"17_CR17","doi-asserted-by":"crossref","first-page":"199","DOI":"10.1016\/0743-1066(94)90027-2","volume":"19","author":"D. Schreye de","year":"1994","unstructured":"Danny de Schreye and Stefaan Decorte. Termination of logic programs: The never-ending story. Journal of Logic Programming, 19,20:199\u2013260, 1994.","journal-title":"Journal of Logic Programming"},{"key":"17_CR18","doi-asserted-by":"crossref","first-page":"207","DOI":"10.1016\/S0747-7171(89)80012-4","volume":"7","author":"J.H. Siekmann","year":"1989","unstructured":"J.H. Siekmann. Unification theory. Journal of Symbolic Computation, 7:207\u2013274, 1989.","journal-title":"Journal of Symbolic Computation"},{"key":"17_CR19","doi-asserted-by":"crossref","first-page":"23","DOI":"10.1006\/jsco.1994.1003","volume":"17","author":"H. Zantema","year":"1994","unstructured":"H. Zantema. Termination of term rewriting: interpretation and type elimination. Journal of Symbolic Computation, 17:23\u201350, 1994.","journal-title":"Journal of Symbolic Computation"},{"key":"17_CR20","doi-asserted-by":"crossref","first-page":"89","DOI":"10.3233\/FI-1995-24124","volume":"24","author":"H. Zantema","year":"1995","unstructured":"H. Zantema. Termination of term rewriting by semantic labelling. Fundamenta Informaticae, 24:89\u2013105, 1995.","journal-title":"Fundamenta Informaticae"}],"container-title":["Lecture Notes in Computer Science","Logic Program Synthesis and Transformation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-60939-3_17.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,28]],"date-time":"2021-04-28T01:28:28Z","timestamp":1619573308000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-60939-3_17"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1996]]},"ISBN":["9783540609391","9783540497455"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/3-540-60939-3_17","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1996]]}}}