{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:28:21Z","timestamp":1759638501126},"publisher-location":"Cham","reference-count":12,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319906850"},{"type":"electronic","value":"9783319906867"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2018]]},"DOI":"10.1007\/978-3-319-90686-7_8","type":"book-chapter","created":{"date-parts":[[2018,4,23]],"date-time":"2018-04-23T17:49:55Z","timestamp":1524505795000},"page":"116-131","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Confluence Modulo Equivalence with Invariants in Constraint Handling Rules"],"prefix":"10.1007","author":[{"given":"Daniel","family":"Gall","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Thom","family":"Fr\u00fchwirth","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2018,4,24]]},"reference":[{"key":"8_CR1","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511609886","volume-title":"Constraint Handling Rules","author":"T Fr\u00fchwirth","year":"2009","unstructured":"Fr\u00fchwirth, T.: Constraint Handling Rules. Cambridge University Press, New York (2009)"},{"key":"8_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/3-540-61551-2_62","volume-title":"Principles and Practice of Constraint Programming \u2014 CP96","author":"S Abdennadher","year":"1996","unstructured":"Abdennadher, S., Fr\u00fchwirth, T., Meuss, H.: On confluence of Constraint Handling Rules. In: Freuder, E.C. (ed.) CP 1996. LNCS, vol. 1118, pp. 1\u201315. Springer, Heidelberg (1996). https:\/\/doi.org\/10.1007\/3-540-61551-2_62"},{"key":"8_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"252","DOI":"10.1007\/BFb0017444","volume-title":"Principles and Practice of Constraint Programming-CP97","author":"S Abdennadher","year":"1997","unstructured":"Abdennadher, S.: Operational semantics and confluence of constraint propagation rules. In: Smolka, G. (ed.) CP 1997. LNCS, vol. 1330, pp. 252\u2013266. Springer, Heidelberg (1997). https:\/\/doi.org\/10.1007\/BFb0017444"},{"issue":"2","key":"8_CR4","doi-asserted-by":"publisher","first-page":"133","DOI":"10.1023\/A:1009842826135","volume":"4","author":"S Abdennadher","year":"1999","unstructured":"Abdennadher, S., Fr\u00fchwirth, T., Meuss, H.: Confluence and semantics of constraint simplification rules. Constraints 4(2), 133\u2013165 (1999)","journal-title":"Constraints"},{"key":"8_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"224","DOI":"10.1007\/978-3-540-74610-2_16","volume-title":"Logic Programming","author":"GJ Duck","year":"2007","unstructured":"Duck, G.J., Stuckey, P.J., Sulzmann, M.: Observable confluence for Constraint Handling Rules. In: Dahl, V., Niemel\u00e4, I. (eds.) ICLP 2007. LNCS, vol. 4670, pp. 224\u2013239. Springer, Heidelberg (2007). https:\/\/doi.org\/10.1007\/978-3-540-74610-2_16"},{"key":"8_CR6","unstructured":"Duck, G.J., Stuckey, P.J., Sulzmann, M.: Observable confluence for Constraint Handling Rules. In: Schrijvers, T., Fr\u00fchwirth, T. (eds.) CHR 2006. K.U. Leuven, Department of Computer Science, Technical report CW 452, pp. 61\u201376, July 2006"},{"key":"8_CR7","doi-asserted-by":"crossref","unstructured":"Raiser, F.: Graph transformation systems in constraint handling rules: improved methods for program analysis. Ph.D. thesis, Ulm University, Germany (2010)","DOI":"10.1017\/S1471068410000438"},{"key":"8_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1007\/978-3-319-17822-6_3","volume-title":"Logic-Based Program Synthesis and Transformation","author":"H Christiansen","year":"2015","unstructured":"Christiansen, H., Kirkeby, M.H.: Confluence modulo equivalence in Constraint Handling Rules. In: Proietti, M., Seki, H. (eds.) LOPSTR 2014. LNCS, vol. 8981, pp. 41\u201358. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-17822-6_3"},{"issue":"1","key":"8_CR9","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1007\/s00165-016-0396-9","volume":"29","author":"H Christiansen","year":"2017","unstructured":"Christiansen, H., Kirkeby, M.H.: On proving confluence modulo equivalence for Constraint Handling Rules. Formal Aspects Comput. 29(1), 57\u201395 (2017)","journal-title":"Formal Aspects Comput."},{"key":"8_CR10","unstructured":"Raiser, F., Betz, H., Fr\u00fchwirth, T.: Equivalence of CHR states revisited. In: Raiser, F., Sneyers, J. (eds.) 6th International Workshop on Constraint Handling Rules (CHR), KULCW, Technical report CW 555, pp. 33\u201348, July 2009"},{"issue":"4","key":"8_CR11","doi-asserted-by":"publisher","first-page":"797","DOI":"10.1145\/322217.322230","volume":"27","author":"G Huet","year":"1980","unstructured":"Huet, G.: Confluent reductions: abstract properties and applications to term rewriting systems. J. ACM (JACM) 27(4), 797\u2013821 (1980)","journal-title":"J. ACM (JACM)"},{"key":"8_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1007\/BFb0052358","volume-title":"Rewriting Techniques and Applications","author":"E Ohlebusch","year":"1998","unstructured":"Ohlebusch, E.: Church-Rosser theorems for abstract reduction modulo an equivalence relation. In: Nipkow, T. (ed.) RTA 1998. LNCS, vol. 1379, pp. 17\u201331. Springer, Heidelberg (1998). https:\/\/doi.org\/10.1007\/BFb0052358"}],"container-title":["Lecture Notes in Computer Science","Functional and Logic Programming"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-90686-7_8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,10,16]],"date-time":"2019-10-16T22:29:59Z","timestamp":1571264999000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-90686-7_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783319906850","9783319906867"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-90686-7_8","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2018]]}}}