{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,10,4]],"date-time":"2026-10-04T07:28:34Z","timestamp":1791098914566,"version":"4.1.0"},"reference-count":24,"publisher":"Cambridge University Press (CUP)","issue":"4-6","license":[{"start":{"date-parts":[[2010,7,9]],"date-time":"2010-07-09T00:00:00Z","timestamp":1278633600000},"content-version":"unspecified","delay-in-days":8,"URL":"https:\/\/www.cambridge.org\/core\/terms"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theory and Practice of Logic Programming"],"published-print":{"date-parts":[[2010,7]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>We observe that the various formulations of the operational semantics of Constraint Handling Rules proposed over the years fall into a spectrum ranging from the analytical to the pragmatic. While existing analytical formulations facilitate program analysis and formal proofs of program properties, they cannot be implemented as is. We propose a novel operational semantics \u03c9<jats:sub>!<\/jats:sub>, which has a strong analytical foundation, while featuring a terminating execution model. We prove its soundness and completeness with respect to existing analytical formulations and we provide an implementation in the form of a source-to-source transformation to CHR with rule priorities.<\/jats:p>","DOI":"10.1017\/s147106841000030x","type":"journal-article","created":{"date-parts":[[2010,7,9]],"date-time":"2010-07-09T08:44:40Z","timestamp":1278665080000},"page":"597-610","source":"Crossref","is-referenced-by-count":13,"title":["A complete and terminating execution model for Constraint Handling Rules"],"prefix":"10.1017","volume":"10","author":[{"given":"HARIOLF","family":"BETZ","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"FRANK","family":"RAISER","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"THOM","family":"FR\u00dcHWIRTH","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"56","published-online":{"date-parts":[[2010,7,9]]},"reference":[{"key":"S147106841000030X_ref13","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511609886"},{"key":"S147106841000030X_ref6","doi-asserted-by":"crossref","unstructured":"Betz H. , Raiser F. , and Fr\u00fchwirth T. 2010. A Complete and Terminating Execution Model for Constraint Handling Rules. Technical Report 01, Ulm University.","DOI":"10.1017\/S147106841000030X"},{"key":"S147106841000030X_ref17","first-page":"209","volume-title":"Logic Programming, 18th International Conference, ICLP 2002","author":"Ganzinger","year":"2002"},{"key":"S147106841000030X_ref22","doi-asserted-by":"publisher","DOI":"10.1017\/S1471068409990123"},{"key":"S147106841000030X_ref15","first-page":"80","volume-title":"Principles and Practice of Constraint Programming","author":"Fr\u00fchwirth","year":"1993"},{"key":"S147106841000030X_ref24","first-page":"20","volume-title":"Proceedings of the 10th International ACM SIGPLAN Conference on Principles and Practice of Declarative Programming (PPDP)","author":"Sulzmann","year":"2008"},{"key":"S147106841000030X_ref18","first-page":"499","volume-title":"25th International Conference Logic Programming, ICLP","author":"Pilozzi","year":"2009"},{"key":"S147106841000030X_ref1","doi-asserted-by":"crossref","first-page":"252","DOI":"10.1007\/BFb0017444","volume-title":"3rd International Conf. on Principles and Practice of Constraint Programming","author":"Abdennadher","year":"1997"},{"key":"S147106841000030X_ref20","first-page":"170","volume-title":"9th Intl. Symp. Practical Aspects of Declarative Languages, PADL","author":"Sarna-Starosta","year":"2007"},{"key":"S147106841000030X_ref16","first-page":"267","volume-title":"Proceedings of the 11th International ACM SIGPLAN Conference on Principles and Practice of Declarative Programming","author":"Gabbrielli","year":"2009"},{"key":"S147106841000030X_ref9","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-78969-7_5"},{"key":"S147106841000030X_ref21","first-page":"336","volume-title":"Automata, Languages and Programming, 35th International Colloquium, ICALP 2008","author":"Simmons","year":"2008"},{"key":"S147106841000030X_ref10","first-page":"90","volume-title":"Logic Programming, 20th International Conference, ICLP 2004","author":"Duck","year":"2004"},{"key":"S147106841000030X_ref2","first-page":"43","volume-title":"Principles and Practice of Constraint Programming, CP 1999","author":"Abdennadher","year":"1999"},{"key":"S147106841000030X_ref3","doi-asserted-by":"publisher","DOI":"10.1023\/A:1009842826135"},{"key":"S147106841000030X_ref4","doi-asserted-by":"publisher","DOI":"10.1007\/11564751_13"},{"key":"S147106841000030X_ref5","unstructured":"Betz H. , Raiser F. , and Fr\u00fchwirth T. 2009. Persistent constraint in constraint handling rules. In Proceedings of 23rd Workshop on (Constraint) Logic Programming, WLP 2009 (to appear)."},{"key":"S147106841000030X_ref19","first-page":"34","volume-title":"6th International Workshop on Constraint Handling Rules (CHR)","author":"Raiser","year":"2009"},{"key":"S147106841000030X_ref7","doi-asserted-by":"publisher","DOI":"10.1017\/S1471068409003664"},{"key":"S147106841000030X_ref8","doi-asserted-by":"publisher","DOI":"10.1145\/1273920.1273924"},{"key":"S147106841000030X_ref11","doi-asserted-by":"crossref","first-page":"95","DOI":"10.1016\/S0743-1066(98)10005-5","article-title":"Theory and practice of constraint handling rules","volume":"37","author":"Fr\u00fchwirth","year":"1998","journal-title":"Journal of Logic Programming, Special Issue on Constraint Logic Programming"},{"key":"S147106841000030X_ref12","first-page":"113","volume-title":"Logic Programming, 21st International Conference, ICLP 2005","author":"Fr\u00fchwirth","year":"2005"},{"key":"S147106841000030X_ref14","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-05138-2"},{"key":"S147106841000030X_ref23","first-page":"19","volume-title":"Proceedings of the POPL 2007 Workshop on Declarative Aspects of Multicore Programming","author":"Sulzmann","year":"2007"}],"container-title":["Theory and Practice of Logic Programming"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.cambridge.org\/core\/services\/aop-cambridge-core\/content\/view\/S147106841000030X","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,6,1]],"date-time":"2023-06-01T20:50:17Z","timestamp":1685652617000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.cambridge.org\/core\/product\/identifier\/S147106841000030X\/type\/journal_article"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,7]]},"references-count":24,"journal-issue":{"issue":"4-6","published-print":{"date-parts":[[2010,7]]}},"alternative-id":["S147106841000030X"],"URL":"https:\/\/doi.org\/10.1017\/s147106841000030x","relation":{},"ISSN":["1471-0684","1475-3081"],"issn-type":[{"value":"1471-0684","type":"print"},{"value":"1475-3081","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010,7]]}}}