{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T00:24:32Z","timestamp":1743035072123,"version":"3.40.3"},"publisher-location":"Cham","reference-count":20,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030162016"},{"type":"electronic","value":"9783030162023"}],"license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"tdm","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":[[2019]]},"DOI":"10.1007\/978-3-030-16202-3_7","type":"book-chapter","created":{"date-parts":[[2019,3,15]],"date-time":"2019-03-15T05:04:08Z","timestamp":1552626248000},"page":"112-130","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Towards a Constraint Solver for Proving Confluence with Invariant and Equivalence of Realistic CHR Programs"],"prefix":"10.1007","author":[{"given":"Henning","family":"Christiansen","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Maja H.","family":"Kirkeby","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2019,3,16]]},"reference":[{"key":"7_CR1","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). \n                      https:\/\/doi.org\/10.1007\/BFb0017444"},{"key":"7_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). \n                      https:\/\/doi.org\/10.1007\/3-540-61551-2_62"},{"issue":"2","key":"7_CR3","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.W., Meuss, H.: Confluence and semantics of constraint simplification rules. Constraints 4(2), 133\u2013165 (1999)","journal-title":"Constraints"},{"key":"7_CR4","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). \n                      https:\/\/doi.org\/10.1007\/978-3-319-17822-6_3"},{"issue":"1","key":"7_CR5","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":"7_CR6","unstructured":"Christiansen, H., Kirkeby, M.H.: Confluence of CHR revisited: invariants and modulo equivalence. In: LOPSTR 2018, vol. 11408. LNCS, pp. 83\u201399. Springer, Heidelberg (2019)"},{"key":"7_CR7","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). \n                      https:\/\/doi.org\/10.1007\/978-3-540-74610-2_16"},{"issue":"3","key":"7_CR8","doi-asserted-by":"publisher","first-page":"1","DOI":"10.2168\/LMCS-6(3:20)2010","volume":"6","author":"J Endrullis","year":"2010","unstructured":"Endrullis, J., de Vrijer, R.C., Waldmann, J.: Local termination: theory and practice. Logical Methods Comput. Sci. 6(3), 1\u201337 (2010)","journal-title":"Logical Methods Comput. Sci."},{"key":"7_CR9","unstructured":"Fr\u00fchwirth, T.W.: User-defined constraint handling. In: ICLP, pp. 837\u2013838. MIT Press (1993)"},{"issue":"1\u20133","key":"7_CR10","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1016\/S0743-1066(98)10005-5","volume":"37","author":"TW Fr\u00fchwirth","year":"1998","unstructured":"Fr\u00fchwirth, T.W.: Theory and practice of constraint handling rules. J. Logic Program. 37(1\u20133), 95\u2013138 (1998)","journal-title":"J. Logic Program."},{"key":"7_CR11","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"298","DOI":"10.1007\/3-540-44654-0_15","volume-title":"New Trends in Constraints","author":"T Fr\u00fchwirth","year":"2000","unstructured":"Fr\u00fchwirth, T.: Proving termination of constraint solver programs. In: Apt, K.R., Monfroy, E., Kakas, A.C., Rossi, F. (eds.) WC 1999. LNCS (LNAI), vol. 1865, pp. 298\u2013317. Springer, Heidelberg (2000). \n                      https:\/\/doi.org\/10.1007\/3-540-44654-0_15"},{"key":"7_CR12","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511609886","volume-title":"Constraint Handling Rules","author":"TW Fr\u00fchwirth","year":"2009","unstructured":"Fr\u00fchwirth, T.W.: Constraint Handling Rules. Cambridge University Press, Cambridge (2009)"},{"key":"7_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"116","DOI":"10.1007\/978-3-319-90686-7_8","volume-title":"Functional and Logic Programming","author":"D Gall","year":"2018","unstructured":"Gall, D., Fr\u00fchwirth, T.: Confluence modulo equivalence with invariants in constraint handling rules. In: Gallagher, J.P., Sulzmann, M. (eds.) FLOPS 2018. LNCS, vol. 10818, pp. 116\u2013131. Springer, Cham (2018). \n                      https:\/\/doi.org\/10.1007\/978-3-319-90686-7_8"},{"issue":"4","key":"7_CR14","doi-asserted-by":"publisher","first-page":"369","DOI":"10.1080\/088395100117043","volume":"14","author":"C Holzbaur","year":"2000","unstructured":"Holzbaur, C., Fr\u00fchwirth, T.W.: A PROLOG constraint handling rules compiler and runtime system. Appl. Artif. Intell. 14(4), 369\u2013388 (2000)","journal-title":"Appl. Artif. Intell."},{"issue":"4","key":"7_CR15","doi-asserted-by":"publisher","first-page":"797","DOI":"10.1145\/322217.322230","volume":"27","author":"GP Huet","year":"1980","unstructured":"Huet, G.P.: Confluent reductions: abstract properties and applications to term rewriting systems. J. ACM 27(4), 797\u2013821 (1980)","journal-title":"J. ACM"},{"key":"7_CR16","unstructured":"Langbein, J., Raiser, F., Fr\u00fchwirth, T.W.: A state equivalence and confluence checker for CHRs. In: Proceedings International Workshop on Constraint Handling Rules, Report CW 588, pp. 1\u20138. Katholieke Universiteit Leuven, Belgium (2010)"},{"issue":"2","key":"7_CR17","doi-asserted-by":"publisher","first-page":"223","DOI":"10.2307\/1968867","volume":"43","author":"M Newman","year":"1942","unstructured":"Newman, M.: On theories with a combinatorial definition of \u201cequivalence\u201d. Ann. Math. 43(2), 223\u2013243 (1942)","journal-title":"Ann. Math."},{"key":"7_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"504","DOI":"10.1007\/978-3-642-02846-5_43","volume-title":"Logic Programming","author":"P Pilozzi","year":"2009","unstructured":"Pilozzi, P., De Schreye, D.: Automating termination proofs for CHR. In: Hill, P.M., Warren, D.S. (eds.) ICLP 2009. LNCS, vol. 5649, pp. 504\u2013508. Springer, Heidelberg (2009). \n                      https:\/\/doi.org\/10.1007\/978-3-642-02846-5_43"},{"key":"7_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"189","DOI":"10.1007\/978-3-642-32211-2_13","volume-title":"Logic-Based Program Synthesis and Transformation","author":"P Pilozzi","year":"2012","unstructured":"Pilozzi, P., De Schreye, D.: Improved termination analysis of CHR using self-sustainability analysis. In: Vidal, G. (ed.) LOPSTR 2011. LNCS, vol. 7225, pp. 189\u2013204. Springer, Heidelberg (2012). \n                      https:\/\/doi.org\/10.1007\/978-3-642-32211-2_13"},{"key":"7_CR20","unstructured":"Schrijvers, T., Demoen, B.: The K.U. Leuven CHR system: implementation and application. In: Workshop on Constraint Handling Rules: Selected Contributions, pp. 1\u20135. Ulmer Informatik-Berichte, Nr. 2004\u201301 (2004)"}],"container-title":["Lecture Notes in Computer Science","Functional and Constraint Logic Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-16202-3_7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,20]],"date-time":"2019-05-20T08:54:34Z","timestamp":1558342474000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-16202-3_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030162016","9783030162023"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-16202-3_7","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2019]]},"assertion":[{"value":"16 March 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"WFLP","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Workshop on Functional and Constraint Logic Programming","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Frankfurt\/Main","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Germany","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2018","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"6 September 2018","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"6 September 2018","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"26","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"wflp2018","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/ppdp-lopstr-18.cs.uni-frankfurt.de\/wflp18.html","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"19","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"10","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"53% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"4","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"3","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}}]}}