{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,20]],"date-time":"2025-06-20T22:02:17Z","timestamp":1750456937360},"publisher-location":"Berlin, Heidelberg","reference-count":29,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540678854"},{"type":"electronic","value":"9783540446545"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2000]]},"DOI":"10.1007\/3-540-44654-0_15","type":"book-chapter","created":{"date-parts":[[2007,4,28]],"date-time":"2007-04-28T03:42:39Z","timestamp":1177731759000},"page":"298-317","source":"Crossref","is-referenced-by-count":14,"title":["Proving Termination of Constraint Solver Programs"],"prefix":"10.1007","author":[{"given":"Thom","family":"Fr\u00fchwirth","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2001,6,28]]},"reference":[{"key":"15_CR1","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"252","DOI":"10.1007\/BFb0017444","volume-title":"3rd Intl Conf on Principles and Practice of Constraint Programming (CP\u201997)","author":"S. Abdennadher","year":"1997","unstructured":"S. Abdennadher, Operational Semantics and Confluence of Constraint Propagation Rules, 3rd Intl Conf on Principles and Practice of Constraint Programming (CP\u201997), Linz, Austria, Springer LNCS 1330, pp 252\u2013265, October\/November 1997."},{"key":"15_CR2","series-title":"Lect Notes Comput Sci","volume-title":"5th Intl Conf on Principles and Practice of Constraint Programming (CP\u201999)","author":"S. Abdennadher","year":"1999","unstructured":"S. Abdennadher and T. Fr\u00fchwirth, Operational Equivalence of CHR Programs and Constraints, 5th Intl Conf on Principles and Practice of Constraint Programming (CP\u201999), Alexandra, Virginia, USA, Springer LNCS, 1999."},{"key":"15_CR3","doi-asserted-by":"crossref","unstructured":"S. Abdennadher, T. Fr\u00fchwirth and H. Meuss, Confluence and Semantics of Constraint Simplification Rules, Journal Constraints Vol. 4(2), Kluwer Academic Publishers, May 1999.","DOI":"10.1023\/A:1009842826135"},{"key":"15_CR4","doi-asserted-by":"crossref","unstructured":"K.R. Apt and D. Pedreschi, Studies in Pure Prolog: Termination, ESPRIT Computational Logic Symposium, Springer 1990, pp 150\u2013176.","DOI":"10.1007\/978-3-642-76274-1_9"},{"key":"15_CR5","unstructured":"F. Baader and P. Hanschke. A scheme for integrating concrete domains into concept languages. 12th International Joint Conference on Artificial Intelligence, 1991."},{"key":"15_CR6","doi-asserted-by":"crossref","unstructured":"F. Baader and T. Nipkow, Term Rewriting and All That, Cambridge University Press, 1998.","DOI":"10.1017\/CBO9781139172752"},{"key":"15_CR7","unstructured":"F. Benhamou and W.J. Older, Bell Northern Research, Applying interval arithmetic to Integer and Boolean constraints, Technical Report, June 1992."},{"issue":"12","key":"15_CR8","doi-asserted-by":"publisher","first-page":"79","DOI":"10.1016\/0743-1066(93)90014-8","volume":"15","author":"M. Bezem","year":"1993","unstructured":"M. Bezem, Strong Termination of Logic Programs, Journal of Logic Programming Vol. 15(1,2), pp. 79\u201398, 1993.","journal-title":"Journal of Logic Programming"},{"key":"15_CR9","doi-asserted-by":"crossref","unstructured":"H. Comon, M. Dincbas, J.-P. Jouannaud and C. Kirchner, A Methodological View of Constraint Solving, Constraints Journal Vol. 4(4), pp. 337\u2013361, Kluwer Academic Publishers, December 1999.","DOI":"10.1023\/A:1009868906501"},{"key":"15_CR10","series-title":"Lect Notes Comput Sci","volume-title":"1st Intl Conf on Principles and Practice of Constraint Programming (PPCP\u201995)","author":"L. Colussi","year":"1995","unstructured":"L. Colussi, E. Marchiori and M. Marchiori, On Termination of Constraint Logic Programs, 1st Intl Conf on Principles and Practice of Constraint Programming (PPCP\u201995), Cassis, France, Springer LNCS 976, 1995."},{"issue":"1+2","key":"15_CR11","doi-asserted-by":"publisher","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 Vol. 3(1+2), pp. 69\u2013116, 1987.","journal-title":"Journal of Symbolic Computation"},{"key":"15_CR12","first-page":"199","volume-title":"Journal of Logic Programming","author":"D. Schreye de","year":"1994","unstructured":"D. de Schreye and St. Decorte, Termination of Logic Programs: The Never-Ending Story, Journal of Logic Programming Vol. 19, 20, pp. 199\u2013260, Elsevier, New York, USA, 1994."},{"key":"15_CR13","volume-title":"Textbook","author":"T. Fr\u00fchwirth","year":"1997","unstructured":"T. Fr\u00fchwirth and S. Abdennadher, Constraint-Programmierung (in German), Textbook, Springer Verlag, Heidelberg, Germany, September 1997."},{"key":"15_CR14","doi-asserted-by":"crossref","unstructured":"T. Fr\u00fchwirth and P. Brisset, Optimal Placement of Base Stations in Wireless Indoor Communication Networks, Special Issue of the IEEE Intelligent Systems Magazine on Practical Applications of Constraint Technology, (M. Wallace and G. Freuder, Eds.), IEEE Press, Vol. 15(1), pp. 49\u201353, January\/February 2000.","DOI":"10.1109\/5254.820329"},{"key":"15_CR15","volume-title":"Terminological Reasoning with Constraint Handling Rules, in Principles and Practice of Constraint Programming","author":"T. Fr\u00fchwirth","year":"1995","unstructured":"T. Fr\u00fchwirth and P. Hanschke, Terminological Reasoning with Constraint Handling Rules, in Principles and Practice of Constraint Programming, (P. van Hentenryck and V.J. Saraswat, Eds.), MIT Press, Cambridge, Mass., USA, 1995."},{"key":"15_CR16","doi-asserted-by":"crossref","unstructured":"T. Fr\u00fchwirth, Theory and Practice of Constraint Handling Rules, Special Issue on Constraint Logic Programming (P. J. Stuckey and K. Marriot, Eds., Journal of Logic Programming Vol. 37(1\u20133), pp. 95\u2013138, Oct\u2013Dec 1998.","DOI":"10.1016\/S0743-1066(98)10005-5"},{"key":"15_CR17","doi-asserted-by":"crossref","unstructured":"C. Holzbaur and T. Fr\u00fchwirth, A Prolog Constraint Handling Rules Compiler and Runtime System, Special Issue of the Journal of Applied Artificial Intelligence on Constraint Handling Rules (C. Holzbaur and T. Fr\u201duhwirth, Eds., Taylor & Francis, to appear 2000.","DOI":"10.1080\/088395100117043"},{"key":"15_CR18","series-title":"Lect Notes Comput Sci","volume-title":"Constraint Programming: Basics and Trends","author":"J.-L. J. Imbert","year":"1995","unstructured":"J.-L. J. Imbert, Linear Constraint Solving in CLP-Languages, in Constraint Programming: Basics and Trends, (A. Podelski, Ed.), LNCS 910, March 1995."},{"key":"15_CR19","doi-asserted-by":"publisher","first-page":"503","DOI":"10.1016\/0743-1066(94)90033-7","volume":"1920","author":"J. Jaffar","year":"1994","unstructured":"J. Jaffar and M. J. Maher, Constraint Logic Programming: A Survey, Journal of Logic Programming Vol. 19,20, pp. 503\u2013581, 1994.","journal-title":"Journal of Logic Programming"},{"key":"15_CR20","doi-asserted-by":"crossref","unstructured":"M.R.K. Krishna Rao, D. Kapur and R. K. Shyamasundar, Proving Termination of GHC Programs, New Generation Computing, 1997.","DOI":"10.1007\/BF03037949"},{"key":"15_CR21","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1016\/0004-3702(85)90041-4","volume":"25","author":"A. K. Mackworth","year":"1985","unstructured":"A. K. Mackworth and E. C. Freuder, The Complexity of Some Polynomial Network Consistency Algorithms for Constraint Satisfaction Problems, Journal of Artificial Intelligence Vol. 25, pp. 65\u201374, 1985.","journal-title":"Journal of Artificial Intelligence"},{"key":"15_CR22","doi-asserted-by":"crossref","DOI":"10.7551\/mitpress\/5625.001.0001","volume-title":"Programming with Constraints","author":"K. Marriott","year":"1998","unstructured":"K. Marriott and P. J. Stuckey, Programming with Constraints, MIT Press, USA, March 1998."},{"key":"15_CR23","doi-asserted-by":"crossref","unstructured":"E. Marchiori and F. Teusink, Proving Termination of Logic Programs with Delay Declarations, ILPS 95, 1995.","DOI":"10.1016\/S0743-1066(98)10034-1"},{"key":"15_CR24","first-page":"858","volume-title":"4th Intl Conf on Logic Programming","author":"M. J. Maher","year":"1987","unstructured":"M. J. Maher, Logic Semantics for a Class of Committed-Choice Programs, 4th Intl Conf on Logic Programming, Melbourne, Australia, pp 858\u2013876, MIT Press, Cambridge, Mass., USA, 1987."},{"key":"15_CR25","first-page":"7","volume-title":"Joint Intl Conf and Symposium on Logic Programming (JICSLP\u201996)","author":"F. Mesnard","year":"1996","unstructured":"F. Mesnard, Inferring Left-terminating Classes of Queries for Constraint Logic Programs, Joint Intl Conf and Symposium on Logic Programming (JICSLP\u201996), (M. Maher, Ed.), pp 7\u201321, Bonn, Germany, MIT Press, September 1996."},{"key":"15_CR26","volume-title":"Technical Report 92\/5","author":"L. Naish","year":"1992","unstructured":"L. Naish, Coroutining and the Construction of Terminating Logic Programs, Technical Report 92\/5, Dept of Computer Science, University of Melbourne, Australia, 1992."},{"key":"15_CR27","unstructured":"L. Pl\u00fcmer, Automatic Verification of GHC-Programs: Termination, Fifth Generation Computer Systems, (FGCS\u201992), Tokyo, Japan, June 1992."},{"key":"15_CR28","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"838","DOI":"10.1007\/3-540-63165-8_236","volume-title":"Termination of Constraint Logic Programs","author":"S. Ruggieri","year":"1997","unstructured":"S. Ruggieri, Termination of Constraint Logic Programs, ICALP 1997, Springer LNCS 1256, pp. 838\u2013848, 1997."},{"issue":"1\u20133","key":"15_CR29","doi-asserted-by":"crossref","first-page":"113","DOI":"10.1016\/0004-3702(92)90006-J","volume":"58","author":"P. Hentenryck","year":"1992","unstructured":"P. van Hentenryck, H. Simonis and M. Dincbas, Constraint Satisfaction Using Constraint Logic Programming, Artificial Intelligence, 58(1\u20133):113\u2013159, December 1992.","journal-title":"Artificial Intelligence"}],"container-title":["Lecture Notes in Computer Science","New Trends in Constraints"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-44654-0_15","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,5,11]],"date-time":"2023-05-11T16:42:20Z","timestamp":1683823340000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-44654-0_15"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000]]},"ISBN":["9783540678854","9783540446545"],"references-count":29,"URL":"https:\/\/doi.org\/10.1007\/3-540-44654-0_15","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2000]]}}}