{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T17:59:01Z","timestamp":1743011941608,"version":"3.40.3"},"publisher-location":"Cham","reference-count":36,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031450716"},{"type":"electronic","value":"9783031450723"}],"license":[{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2023]]},"DOI":"10.1007\/978-3-031-45072-3_14","type":"book-chapter","created":{"date-parts":[[2023,10,14]],"date-time":"2023-10-14T11:01:34Z","timestamp":1697281294000},"page":"190-205","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["FreeCHR: An Algebraic Framework for\u00a0CHR-Embeddings"],"prefix":"10.1007","author":[{"given":"Sascha","family":"Rechenberger","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":[[2023,10,15]]},"reference":[{"key":"14_CR1","doi-asserted-by":"publisher","unstructured":"Abdennadher, S., Kr\u00e4mer, E., Saft, M., Schmauss, M.: JACK: a java constraint kit. In: Electronic Notes in Theoretical Computer Science, vol. 64, pp. 1\u201317 (2002). https:\/\/doi.org\/10.1016\/S1571-0661(04)80344-X","DOI":"10.1016\/S1571-0661(04)80344-X"},{"issue":"4","key":"14_CR2","doi-asserted-by":"publisher","first-page":"311","DOI":"10.1080\/088395100117016","volume":"14","author":"S Abdennadher","year":"2000","unstructured":"Abdennadher, S., Marte, M.: University course timetabling using constraint handling rules. AAI 14(4), 311\u2013325 (2000). https:\/\/doi.org\/10.1080\/088395100117016","journal-title":"AAI"},{"key":"14_CR3","unstructured":"Barichard, V.: CHR++ (2022). https:\/\/gitlab.com\/vynce\/chrpp"},{"key":"14_CR4","unstructured":"Betz, H.: Relating coloured petri nets to constraint handling rules. In: CHR 2007, vol. 7, pp. 33\u201347 (2007). https:\/\/dtai-static.cs.kuleuven.be\/projects\/CHR\/papers\/chr2007\/betz_petri_nets_chr07.pdf"},{"key":"14_CR5","unstructured":"Chin, W., Sulzmann, M., Wang, M.: A Type-Safe Embedding of Constraint Handling Rules into Haskell (2008). https:\/\/www.semanticscholar.org\/paper\/A-Type-Safe-Embedding-of-Constraint-Handling-Rules-Chin-Sulzmann\/ea47790fc268710d73b2a6be0305e3f3453682e3"},{"key":"14_CR6","unstructured":"De Koninck, L., Schrijvers, T., Demoen, B., Fink, M., Tompits, H., Woltran, S.: INCLP(R) - interval-based nonlinear constraint logic programming over the reals. In: WLP 2006, vol. 1843-06-02. Technische Universit\u00e4t Wien, Austria (2006). https:\/\/lirias.kuleuven.be\/1653773"},{"key":"14_CR7","unstructured":"Duck, G.J.: Compilation of constraint handling rules. Ph.D. thesis, University of Melbourne, Victoria, Australia (2005)"},{"key":"14_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"90","DOI":"10.1007\/978-3-540-27775-0_7","volume-title":"Logic Programming","author":"GJ Duck","year":"2004","unstructured":"Duck, G.J., Stuckey, P.J., de la Banda, M.G., Holzbaur, C.: The refined operational semantics of constraint handling rules. In: Demoen, B., Lifschitz, V. (eds.) ICLP 2004. LNCS, vol. 3132, pp. 90\u2013104. Springer, Heidelberg (2004). https:\/\/doi.org\/10.1007\/978-3-540-27775-0_7"},{"key":"14_CR9","volume-title":"Domain-Specific Languages","author":"M Fowler","year":"2011","unstructured":"Fowler, M., Parsons, R.: Domain-Specific Languages. Addison-Wesley, Upper Saddle River (2011)"},{"key":"14_CR10","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"14","DOI":"10.1007\/11754602_2","volume-title":"Recent Advances in Constraints","author":"T Fr\u00fchwirth","year":"2006","unstructured":"Fr\u00fchwirth, T.: Complete propagation rules for lexicographic order constraints over arbitrary domains. In: Hnich, B., Carlsson, M., Fages, F., Rossi, F. (eds.) CSCLP 2005. LNCS (LNAI), vol. 3978, pp. 14\u201328. Springer, Heidelberg (2006). https:\/\/doi.org\/10.1007\/11754602_2"},{"key":"14_CR11","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511609886","volume-title":"Constraint Handling Rules","author":"T Fruehwirth","year":"2009","unstructured":"Fruehwirth, T.: Constraint Handling Rules. Cambridge University Press, Cambridge; New York (2009)"},{"key":"14_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"13","DOI":"10.1007\/978-3-319-21542-6_2","volume-title":"Rule Technologies: Foundations, Tools, and Applications","author":"T Fr\u00fchwirth","year":"2015","unstructured":"Fr\u00fchwirth, T.: Constraint handling rules - what else? In: Bassiliades, N., Gottlob, G., Sadri, F., Paschke, A., Roman, D. (eds.) RuleML 2015. LNCS, vol. 9202, pp. 13\u201334. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-21542-6_2"},{"key":"14_CR13","unstructured":"Geiselhart, F., Raiser, F., Sneyers, J., Fr\u00fchwirth, T.: MTSeq: multi-touch-enabled CHR-based Music Generation and Manipulation (2010). https:\/\/www.uni-ulm.de\/fileadmin\/website_uni_ulm\/iui.inst.170\/home\/raiser\/publications\/Geiselhart2010.pdf"},{"key":"14_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"74","DOI":"10.1007\/978-3-319-19686-2_6","volume-title":"Practical Aspects of Declarative Languages","author":"M Hanus","year":"2015","unstructured":"Hanus, M.: CHR(Curry): interpretation and compilation of constraint handling rules in curry. In: Pontelli, E., Son, T.C. (eds.) PADL 2015. LNCS, vol. 9131, pp. 74\u201389. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-19686-2_6"},{"key":"14_CR15","unstructured":"Holzbaur, C., Fr\u00fchwirth, T.: Compiling constraint handling rules. In: ERCIM\/COMPULOG Workshop on Constraints, Amsterdam (1998)"},{"key":"14_CR16","doi-asserted-by":"publisher","unstructured":"Hudak, P.: Modular domain specific languages and tools. In: ICSR 1998, pp. 134\u2013142 (1998). https:\/\/doi.org\/10.1109\/ICSR.1998.685738","DOI":"10.1109\/ICSR.1998.685738"},{"key":"14_CR17","doi-asserted-by":"publisher","unstructured":"Ivanovi\u0107, D.: Implementing Constraint Handling Rules as a Domain-Specific Language Embedded in Java (2013). https:\/\/doi.org\/10.48550\/arXiv.1308.3939","DOI":"10.48550\/arXiv.1308.3939"},{"key":"14_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"207","DOI":"10.1007\/978-3-540-73228-0_16","volume-title":"Typed Lambda Calculi and Applications","author":"P Johann","year":"2007","unstructured":"Johann, P., Ghani, N.: Initial algebra semantics is enough! In: Della Rocca, S.R. (ed.) TLCA 2007. LNCS, vol. 4583, pp. 207\u2013222. Springer, Heidelberg (2007). https:\/\/doi.org\/10.1007\/978-3-540-73228-0_16"},{"key":"14_CR19","doi-asserted-by":"publisher","unstructured":"Karth, I., Smith, A.M.: WaveFunctionCollapse is constraint solving in the wild. In: FDG 2017, FDG 2017, pp. 1\u201310. Association for Computing Machinery, New York (2017). https:\/\/doi.org\/10.1145\/3102071.3110566","DOI":"10.1145\/3102071.3110566"},{"key":"14_CR20","unstructured":"Lam, E., Sulzmann, M.: Towards Agent Programming in CHR (2006). https:\/\/www.semanticscholar.org\/paper\/Towards-Agent-Programming-in-CHR-Lam-Sulzmann\/43277216bafb824d651c802ad487dbce8f7f7478"},{"key":"14_CR21","doi-asserted-by":"publisher","unstructured":"Lam, E.S.L., Sulzmann, M.: A concurrent constraint handling rules implementation in Haskell with software transactional memory. In: DAMP 2007, Nice, France, pp. 19\u201324. ACM Press (2007). https:\/\/doi.org\/10.1145\/1248648.1248653","DOI":"10.1145\/1248648.1248653"},{"key":"14_CR22","unstructured":"Milewski, B.: Category Theory for Programmers. Lightning Source UK, Milton Keynes (2019). https:\/\/github.com\/hmemcpy\/milewski-ctfp-pdf"},{"key":"14_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"131","DOI":"10.1007\/978-3-319-99906-7_9","volume-title":"Rules and Reasoning","author":"F Nogatz","year":"2018","unstructured":"Nogatz, F., Fr\u00fchwirth, T., Seipel, D.: CHR.js: a CHR implementation in\u00a0JavaScript. In: Benzm\u00fcller, C., Ricca, F., Parent, X., Roman, D. (eds.) RuleML+RR 2018. LNCS, vol. 11092, pp. 131\u2013146. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-99906-7_9"},{"key":"14_CR24","unstructured":"Rechenberger, S.: Example Instances of FreeCHR (2023). https:\/\/gist.github.com\/SRechenberger\/739683a23f8a9978ae601c6c815d61c4"},{"key":"14_CR25","unstructured":"Rechenberger, S.: FreeCHR-Haskell (2023). https:\/\/github.com\/SRechenberger\/free-chr-hs"},{"key":"14_CR26","unstructured":"Rechenberger, S.: FreeCHR-Python (2023). https:\/\/github.com\/SRechenberger\/freechr-python"},{"key":"14_CR27","doi-asserted-by":"publisher","unstructured":"Rechenberger, S., Fr\u00fchwirth, T.: FreeCHR: An Algebraic Framework for CHR-Embeddings (2023). https:\/\/doi.org\/10.48550\/arXiv.2306.00642","DOI":"10.48550\/arXiv.2306.00642"},{"key":"14_CR28","unstructured":"Schrijvers, T., Demoen, B.: The K.U. Leuven CHR system: implementation and application. In: CHR 2004, pp. 1\u20135 (2004). https:\/\/lirias.kuleuven.be\/retrieve\/33588"},{"key":"14_CR29","unstructured":"Sneyers, J., De Schreye, D.: APOPCALEAPS: automatic music generation with CHRiSM. In: BNAIC 2010 (2010). https:\/\/lirias.kuleuven.be\/1584193"},{"issue":"1","key":"14_CR30","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1017\/S1471068409990123","volume":"10","author":"J Sneyers","year":"2010","unstructured":"Sneyers, J., Weert, P.V., Schrijvers, T., Koninck, L.D.: As time goes by: constraint handling rules: a survey of CHR research from 1998 to 2007. TPLP 10(1), 1\u201347 (2010). https:\/\/doi.org\/10.1017\/S1471068409990123","journal-title":"TPLP"},{"key":"14_CR31","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"70","DOI":"10.1007\/3-540-45619-8_6","volume-title":"Logic Programming","author":"M Thielscher","year":"2002","unstructured":"Thielscher, M.: Reasoning about actions with CHRs and finite domain constraints. In: Stuckey, P.J. (ed.) ICLP 2002. LNCS, vol. 2401, pp. 70\u201384. Springer, Heidelberg (2002). https:\/\/doi.org\/10.1007\/3-540-45619-8_6"},{"issue":"4\u20135","key":"14_CR32","doi-asserted-by":"publisher","first-page":"533","DOI":"10.1017\/S1471068405002358","volume":"5","author":"M Thielscher","year":"2005","unstructured":"Thielscher, M.: FLUX: a logic programming method for reasoning agents. TPLP 5(4\u20135), 533\u2013565 (2005). https:\/\/doi.org\/10.1017\/S1471068405002358","journal-title":"TPLP"},{"issue":"11","key":"14_CR33","doi-asserted-by":"publisher","first-page":"1521","DOI":"10.1109\/tkde.2009.208","volume":"22","author":"P van Weert","year":"2010","unstructured":"van Weert, P.: Efficient lazy evaluation of rule-based programs. IEEE Trans. Knowl. Data Eng. 22(11), 1521\u20131534 (2010). https:\/\/doi.org\/10.1109\/tkde.2009.208","journal-title":"IEEE Trans. Knowl. Data Eng."},{"key":"14_CR34","unstructured":"Van Weert, P., Schrijvers, T., Demoen, B., Schrijvers, T., Fr\u00fchwirth, T.: K.U.Leuven JCHR: a user-friendly, flexible and efficient CHR system for Java. In: CHR 2005. Department of Computer Science, K.U.Leuven (2005). https:\/\/lirias.kuleuven.be\/1654703"},{"key":"14_CR35","unstructured":"Wibiral, T.: JavaCHR \u2013 A Modern CHR-Embedding in Java. Ph.D. thesis, Universit\u00e4t Ulm (2022). https:\/\/oparu.uni-ulm.de\/xmlui\/handle\/123456789\/43506"},{"key":"14_CR36","unstructured":"Wuille, P., Schrijvers, T., Demoen, B.: CCHR: The fastest CHR implementation, in C. In: CHR 2007, pp. 123\u2013137 (2007). https:\/\/lirias.kuleuven.be\/retrieve\/22123"}],"container-title":["Lecture Notes in Computer Science","Rules and Reasoning"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-45072-3_14","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,10,14]],"date-time":"2023-10-14T11:03:19Z","timestamp":1697281399000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-45072-3_14"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031450716","9783031450723"],"references-count":36,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-45072-3_14","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2023]]},"assertion":[{"value":"15 October 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"RuleML+RR","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Joint Conference on Rules and Reasoning","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Oslo","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Norway","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2023","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"18 September 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"20 September 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"7","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"rulemlrr2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/2023.declarativeai.net\/events\/ruleml-rr","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 (provided by the conference organizers)"}},{"value":"Easychair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"46","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"13","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"28% - 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 (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"4","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"6 subreviewers were invited by the pc members and provided 7 reviews","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}