{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,9,30]],"date-time":"2026-09-30T07:13:12Z","timestamp":1790752392203,"version":"4.1.0"},"publisher-location":"Cham","reference-count":138,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783319215419","type":"print"},{"value":"9783319215426","type":"electronic"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"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":[[2015]]},"DOI":"10.1007\/978-3-319-21542-6_2","type":"book-chapter","created":{"date-parts":[[2015,7,11]],"date-time":"2015-07-11T10:59:32Z","timestamp":1436612372000},"page":"13-34","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":15,"title":["Constraint Handling Rules - What Else?"],"prefix":"10.1007","author":[{"given":"Thom","family":"Fr\u00fchwirth","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2015,7,12]]},"reference":[{"key":"2_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"145","DOI":"10.1007\/978-3-319-14125-1_9","volume-title":"Logic-Based Program Synthesis and Transformation","author":"G Fakhry","year":"2014","unstructured":"Fakhry, G., Sharaf, N., Abdennadher, S.: Towards the implementation of a source-to-source transformation tool for CHR operational semantics. In: Gupta, G., Pe\u00f1a, R. (eds.) LOPSTR 2013, LNCS 8901. LNCS, vol. 8901, pp. 145\u2013163. Springer, Heidelberg (2014)"},{"key":"2_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1007\/3-540-49481-2_4","volume-title":"Principles and Practice of Constraint Programming - CP98","author":"S Abdennadher","year":"1998","unstructured":"Abdennadher, S., Fr\u00fchwirth, T.: On completion of constraint handling rules. In: Maher, M.J., Puget, J.-F. (eds.) CP 1998. LNCS, vol. 1520, pp. 25\u201339. Springer, Heidelberg (1998)"},{"key":"2_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"43","DOI":"10.1007\/978-3-540-48085-3_4","volume-title":"Principles and Practice of Constraint Programming \u2013 CP\u201999","author":"S Abdennadher","year":"1999","unstructured":"Abdennadher, S., Fr\u00fchwirth, T.: Operational equivalence of CHR programs and constraints. In: Jaffar, J. (ed.) CP 1999. LNCS, vol. 1713, pp. 43\u201357. Springer, Heidelberg (1999)"},{"key":"2_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"198","DOI":"10.1007\/978-3-540-25938-1_17","volume-title":"Logic Based Program Synthesis and Transformation","author":"S Abdennadher","year":"2004","unstructured":"Abdennadher, S., Fr\u00fchwirth, T.: Integration and optimization of rule-based constraint solvers. In: Bruynooghe, M. (ed.) LOPSTR 2004. LNCS, vol. 3018, pp. 198\u2013213. Springer, Heidelberg (2004)"},{"issue":"2","key":"2_CR5","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":"2_CR6","first-page":"311","volume-title":"Special Issue on Constraint Handling Rules","author":"S Abdennadher","year":"2000","unstructured":"Abdennadher, S., Marte, M.: University course timetabling using constraint handling rules. In: Holzbaur, C., Fr\u00fchwirth, T. (eds.) Special Issue on Constraint Handling Rules, vol. 14(4), pp. 311\u2013325. Taylor & Francis, London (2000). Journal of Applied Artificial Intelligence"},{"issue":"2","key":"2_CR7","doi-asserted-by":"publisher","first-page":"177","DOI":"10.1145\/976706.976707","volume":"5","author":"S Abdennadher","year":"2004","unstructured":"Abdennadher, S., Rigotti, C.: Automatic generation of rule-based constraint solvers over finite domains. ACM TOCL 5(2), 177\u2013205 (2004)","journal-title":"ACM TOCL"},{"issue":"4\u20135","key":"2_CR8","doi-asserted-by":"publisher","first-page":"403","DOI":"10.1017\/S1471068405002371","volume":"5","author":"S Abdennadher","year":"2005","unstructured":"Abdennadher, S., Rigotti, C.: Automatic generation of chr constraint solvers. Theory Pract. Log. Program. 5(4\u20135), 403\u2013418 (2005)","journal-title":"Theory Pract. Log. Program."},{"key":"2_CR9","unstructured":"Abdennadher, S., Saft, M., Will, S.: Classroom assignment using constraint logic programming. In: Proc. 2nd Intl. Conf. and Exhibition on Practical Application of Constraint Technologies and Logic Programming, PACLP 2000, April 2000"},{"key":"2_CR10","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/BFb0055987","volume-title":"Flexible Query Answering Systems","author":"S Abdennadher","year":"1998","unstructured":"Abdennadher, S., Sch\u00fctz, H.: CHR $$^\\vee $$: a flexible query language. In: Andreasen, T., Christiansen, H., Larsen, H.L. (eds.) FQAS 1998. LNCS (LNAI), vol. 1495, pp. 1\u201314. Springer, Heidelberg (1998)"},{"key":"2_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"243","DOI":"10.1007\/978-3-642-14335-9_8","volume-title":"Testing Techniques in Software Engineering","author":"BK Aichernig","year":"2010","unstructured":"Aichernig, B.K.: A systematic introduction to mutation testing in unifying theories of programming. In: Borba, P., Cavalcanti, A., Sampaio, A., Woodcook, J. (eds.) PSSE 2007. LNCS, vol. 6153, pp. 243\u2013287. Springer, Heidelberg (2010)"},{"issue":"4\u20135","key":"2_CR12","first-page":"721","volume":"13","author":"E Albert","year":"2013","unstructured":"Albert, E., Garc\u00eda de la Banda, M.J., G\u00f3mez-Zamalloa, M., Rojas, J.M., Stuckey, P.J.: A CLP heap solver for test case generation. TPLP 13(4\u20135), 721\u2013735 (2013). Cambridge University Press","journal-title":"TPLP"},{"issue":"4","key":"2_CR13","doi-asserted-by":"publisher","first-page":"29","DOI":"10.1145\/1380572.1380578","volume":"9","author":"M Alberti","year":"2008","unstructured":"Alberti, M., Chesani, F., Gavanelli, M., Lamma, E., Mello, P., Torroni, P.: Verifiable agent interaction in abductive logic programming: the sciff framework. ACM Transactions on Computational Logic (TOCL) 9(4), 29 (2008)","journal-title":"ACM Transactions on Computational Logic (TOCL)"},{"key":"2_CR14","doi-asserted-by":"crossref","unstructured":"Alberti, M., Daolio, D., Torroni, P., Gavanelli, M., Lamma, E., Mello, P.: Specification and verification of agent interaction protocols in a logic-based system. In: 2004 ACM Symposium on Applied Computing, pp. 72\u201378. ACM (2004)","DOI":"10.1145\/967900.967918"},{"issue":"4","key":"2_CR15","doi-asserted-by":"crossref","first-page":"365","DOI":"10.3233\/FI-2013-839","volume":"124","author":"M Alberti","year":"2013","unstructured":"Alberti, M., Gavanelli, M., Lamma, E.: The CHR-based implementation of the sciff abductive system. Fundamenta Informaticae 124(4), 365\u2013381 (2013)","journal-title":"Fundamenta Informaticae"},{"key":"2_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1007\/978-3-540-30122-6_5","volume-title":"Principles and Practice of Semantic Web Reasoning","author":"L Badea","year":"2004","unstructured":"Badea, L., Tilivea, D., Hotaran, A.: Semantic web reasoning for ontology-based integration of resources. In: Ohlbach, H.J., Schaffert, S. (eds.) PPSWR 2004. LNCS, vol. 3208, pp. 61\u201375. Springer, Heidelberg (2004)"},{"key":"2_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"256","DOI":"10.1007\/978-3-319-06859-6_23","volume-title":"Service-Oriented Computing \u2013 ICSOC 2013 Workshops","author":"G Baryannis","year":"2014","unstructured":"Baryannis, G., Plexousakis, D.: Fluent calculus-based semantic web service composition and verification using WSSL. In: Lomuscio, A.R., Nepal, S., Patrizi, F., Benatallah, B., Brandi\u0107, I. (eds.) ICSOC 2013. LNCS, vol. 8377, pp. 256\u2013270. Springer, Heidelberg (2014)"},{"key":"2_CR18","unstructured":"Betz, H.: Relating coloured petri nets to constraint handling rules. In: Fourth Workshop on Constraint Handling Rules, pp. 32\u201346 (2007)"},{"key":"2_CR19","unstructured":"Betz, H.: A Unified Analytical Foundation for Constraint Handling Rules. BoD-Books on Demand (2014)"},{"issue":"1","key":"2_CR20","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/2422085.2422086","volume":"14","author":"H Betz","year":"2013","unstructured":"Betz, H., Fr\u00fchwirth, T.: Linear-logic based analysis of Constraint Handling Rules with disjunction. ACM Transactions on Computational Logic (TOCL) 14(1), 1 (2013)","journal-title":"ACM Transactions on Computational Logic (TOCL)"},{"key":"2_CR21","doi-asserted-by":"crossref","unstructured":"Betz, H., Raiser, F., Fr\u00fchwirth, T.: A complete and terminating execution model for constraint handling rules. In: Hermenegildo and Schaub [81], pp. 597\u2013610","DOI":"10.1017\/S147106841000030X"},{"issue":"2","key":"2_CR22","doi-asserted-by":"publisher","first-page":"287","DOI":"10.1111\/j.0824-7935.2004.00239.x","volume":"20","author":"S Bistarelli","year":"2004","unstructured":"Bistarelli, S., Fr\u00fchwirth, T., Marte, M., Rossi, F.: Soft constraint propagation and solving in Constraint Handling Rules. Computational Intelligence: Special Issue on Preferences in AI and CP 20(2), 287\u2013307 (2004)","journal-title":"Computational Intelligence: Special Issue on Preferences in AI and CP"},{"key":"2_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"268","DOI":"10.1007\/978-3-642-16576-4_20","volume-title":"Autonomic and Trusted Computing","author":"S Bistarelli","year":"2010","unstructured":"Bistarelli, S., Martinelli, F., Santini, F.: A formal framework for trust policy negotiation in autonomic systems: abduction with soft constraints. In: Xie, B., Branke, J., Sadjadi, S.M., Zhang, D., Zhou, X. (eds.) ATC 2010. LNCS, vol. 6407, pp. 268\u2013282. Springer, Heidelberg (2010)"},{"issue":"4","key":"2_CR24","doi-asserted-by":"publisher","first-page":"447","DOI":"10.1016\/j.camwa.2011.12.017","volume":"64","author":"S Bistarelli","year":"2012","unstructured":"Bistarelli, S., Martinelli, F., Santini, F.: A semiring-based framework for the deduction\/abduction reasoning in access control with weighted credentials. Computers & Mathematics with Applications 64(4), 447\u2013462 (2012)","journal-title":"Computers & Mathematics with Applications"},{"key":"2_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"244","DOI":"10.1007\/978-3-642-31491-9_19","volume-title":"Modelling Foundations and Applications","author":"F B\u00fcttner","year":"2012","unstructured":"B\u00fcttner, F., Cabot, J.: Lightweight string reasoning for OCL. In: Vallecillo, A., Tolvanen, J.-P., Kindler, E., St\u00f6rrle, H., Kolovos, D. (eds.) ECMFA 2012. LNCS, vol. 7349, pp. 244\u2013258. Springer, Heidelberg (2012)"},{"key":"2_CR26","doi-asserted-by":"crossref","unstructured":"Chen, R., Liao, L., Fang, Z.: Contracting of web services with constraint handling rules. In: 2012 IEEE Eighth World Congress on Services (SERVICES), pp. 211\u2013218 (2012)","DOI":"10.1109\/SERVICES.2012.36"},{"key":"2_CR27","doi-asserted-by":"crossref","unstructured":"Chin, W.-N., Craciun, F., Khoo, S.-C., Popeea, C.: A flow-based approach for variant parametric types. In: 21st annual ACM SIGPLAN Conference on Object-Oriented Programming Systems, Languages, and Applications, pp. 273\u2013290. ACM (2006)","DOI":"10.1145\/1167473.1167498"},{"issue":"4\u20135","key":"2_CR28","doi-asserted-by":"publisher","first-page":"467","DOI":"10.1017\/S1471068405002395","volume":"5","author":"H Christiansen","year":"2005","unstructured":"Christiansen, H.: Chr grammars. Theory and Practice of Logic Programming 5(4\u20135), 467\u2013501 (2005)","journal-title":"Theory and Practice of Logic Programming"},{"key":"2_CR29","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1007\/978-3-540-92243-8_5","volume-title":"Constraint Handling Rules","author":"H Christiansen","year":"2008","unstructured":"Christiansen, H.: Implementing probabilistic abductive logic programming with constraint handling rules. In: Schrijvers, T., Fr\u00fchwirth, T. (eds.) Constraint Handling Rules. LNCS, vol. 5388, pp. 85\u2013118. Springer, Heidelberg (2008)"},{"key":"2_CR30","doi-asserted-by":"crossref","unstructured":"Christiansen, H., Dahl, V.: HYPROLOG: a new logic programming language with assumptions andabduction. In: Gabbrielli and Gupta [63], pp. 159\u2013173","DOI":"10.1007\/11562931_14"},{"key":"2_CR31","unstructured":"Christiansen, H., Kirkeby, M.H.: Confluence modulo equivalence in Constraint Handling Rules. [90]"},{"key":"2_CR32","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"34","DOI":"10.1007\/978-3-319-19686-2_3","volume-title":"Practical Aspects of Declarative Languages","author":"F Cruz","year":"2015","unstructured":"Cruz, F., Rocha, R.: On compiling linear logic programs with comprehensions, aggregates and rule priorities. In: Pontelli, E., Son, T.C. (eds.) PADL 2015. LNCS, vol. 9131, pp. 34\u201349. Springer, Heidelberg (2015)"},{"issue":"2","key":"2_CR33","first-page":"165","volume":"9","author":"L De Koninck","year":"2009","unstructured":"De Koninck, L.: Logical Algorithms meets CHR: A meta-complexity result for Constraint Handling Rules with rule priorities. TPLP 9(2), 165\u2013212 (2009)","journal-title":"TPLP"},{"key":"2_CR34","unstructured":"De Koninck, L., Schrijvers, T., Demoen, B.: Search strategies in CHR(Prolog). In: Schrijvers and Fr\u00fchwirth [110], pp. 109\u2013124"},{"key":"2_CR35","unstructured":"De Koninck, L., Schrijvers, T., Demoen, B.: Chr$$^{\\rm rp}$$: Constraint Handling Rules with rule priorties. Technical Report CW 479, K.U.Leuven, Dept. Comp. Sc., Leuven, Belgium, March 2007"},{"key":"2_CR36","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"71","DOI":"10.1007\/978-3-642-00515-2_6","volume-title":"Logic-Based Program Synthesis and Transformation","author":"F Degrave","year":"2009","unstructured":"Degrave, F., Schrijvers, T., Vanhoof, W.: Automatic generation of test inputs for mercury. In: Hanus, M. (ed.) LOPSTR 2008. LNCS, vol. 5438, pp. 71\u201386. Springer, Heidelberg (2009)"},{"key":"2_CR37","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"205","DOI":"10.1007\/978-3-540-95891-8_21","volume-title":"SOFSEM 2009: Theory and Practice of Computer Science","author":"C Di Giusto","year":"2009","unstructured":"Di Giusto, C., Gabbrielli, M., Meo, M.C.: Expressiveness of multiple heads in CHR. In: Nielsen, M., Ku\u010dera, A., Miltersen, P.B., Palamidessi, C., T\u016fma, P., Valencia, F. (eds.) SOFSEM 2009. LNCS, vol. 5404, pp. 205\u2013216. Springer, Heidelberg (2009)"},{"key":"2_CR38","unstructured":"Djelloul, K., Duck, G.J., Sulzmann, M. (eds.) Proc. 4th Workshop on Constraint Handling Rules, CHR 2007, September 2007"},{"key":"2_CR39","unstructured":"Duck, G.J.: SMCHR: Satisfiability modulo Constraint Handling Rules. CoRR, abs\/1210.5307 (2012)"},{"issue":"4\u20135","key":"2_CR40","first-page":"619","volume":"14","author":"GJ Duck","year":"2014","unstructured":"Duck, G.J., Haemmerl\u00e9, R., Sulzmann, M.: On termination, confluence and consistent CHR-based type inference. TPLP 14(4\u20135), 619\u2013632 (2014)","journal-title":"TPLP"},{"key":"2_CR41","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"282","DOI":"10.1007\/978-3-642-40627-0_24","volume-title":"Principles and Practice of Constraint Programming","author":"GJ Duck","year":"2013","unstructured":"Duck, G.J., Jaffar, J., Koh, N.C.H.: Constraint-based program reasoning with heaps and separation. In: Schulte, C. (ed.) CP 2013. LNCS, vol. 8124, pp. 282\u2013298. Springer, Heidelberg (2013)"},{"key":"2_CR42","doi-asserted-by":"crossref","unstructured":"Duck, G.J., Koninck, L.D., Stuckey, P.J.: Cadmium: an implementation of ACD term rewriting. In: Garc\u00eda de la Banda and Pontelli [70], pp. 531\u2013545","DOI":"10.1007\/978-3-540-89982-2_45"},{"key":"2_CR43","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., Garc\u00eda de la Banda, M., 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)"},{"key":"2_CR44","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)"},{"key":"2_CR45","unstructured":"Escrig, M., Toledo, F.: Qualitative Spatial Reasoning: Theory and Practice. IOS Press (1998)"},{"key":"2_CR46","unstructured":"Fink, M., Tompits, H., Woltran, S. (eds.) Proc. 20th Workshop on Logic Programming, WLP 2006, T.U.Wien, Austria, INFSYS Research report 1843\u201306-02, February 2006"},{"issue":"1\u20133","key":"2_CR47","doi-asserted-by":"crossref","first-page":"95","DOI":"10.1016\/S0743-1066(98)10005-5","volume":"37","author":"T Fr\u00fchwirth","year":"1998","unstructured":"Fr\u00fchwirth, T.: Theory and practice of Constraint Handling Rules. J. Logic Programming, Special Issue on Constraint Logic Programming 37(1\u20133), 95\u2013138 (1998)","journal-title":"J. Logic Programming, Special Issue on Constraint Logic Programming"},{"key":"2_CR48","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., Kakas, A.C., Monfroy, E., Rossi, F. (eds.) Compulog Net WS 1999. LNCS (LNAI), vol. 1865, pp. 298\u2013317. Springer, Heidelberg (2000)"},{"key":"2_CR49","unstructured":"Fr\u00fchwirth, T.: As time goes by: automatic complexity analysis of simplification rules. In: Eighth International Conference on Principles of Knowledge Representation and Reasoning, San Francisco, CA, USA. Morgan Kaufmann (2002)"},{"issue":"3","key":"2_CR50","first-page":"185","volume":"59","author":"T Fr\u00fchwirth","year":"2002","unstructured":"Fr\u00fchwirth, T.: As Time Goes By II: More Automatic Complexity Analysis of Concurrent Rule Programs. ENTCS 59(3), 185\u2013206 (2002)","journal-title":"ENTCS"},{"key":"2_CR51","doi-asserted-by":"crossref","unstructured":"Fr\u00fchwirth, T.: Parallelizing union-find in constraint handling rules using confluence. In: Gabbrielli and Gupta [63], pp. 113\u2013127","DOI":"10.1007\/11562931_11"},{"key":"2_CR52","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"133","DOI":"10.1007\/11506676_9","volume-title":"Logic Based Program Synthesis and Transformation","author":"T Fr\u00fchwirth","year":"2005","unstructured":"Fr\u00fchwirth, T.: Specialization of concurrent guarded multi-set transformation rules. In: Etalle, S. (ed.) LOPSTR 2004. LNCS, vol. 3573, pp. 133\u2013148. Springer, Heidelberg (2005)"},{"key":"2_CR53","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1007\/978-3-540-89812-2_7","volume-title":"Recent Advances in Constraints","author":"T Fr\u00fchwirth","year":"2008","unstructured":"Fr\u00fchwirth, T.: Quasi-linear-time algorithms by generalisation of union-find in CHR. In: Fages, F., Rossi, F., Soliman, S. (eds.) CSCLP 2007. LNCS (LNAI), vol. 5129, pp. 91\u2013108. Springer, Heidelberg (2008)"},{"key":"2_CR54","doi-asserted-by":"crossref","unstructured":"Fr\u00fchwirth, T.: Welcome to constraint handling rules. In: Schrijvers and Fr\u00fchwirth [112], pp. 1\u201315","DOI":"10.1007\/978-3-540-92243-8_1"},{"key":"2_CR55","doi-asserted-by":"crossref","unstructured":"Fr\u00fchwirth, T.: Constraint Handling Rules. Cambridge University Press (2009)","DOI":"10.1017\/CBO9780511609886"},{"key":"2_CR56","doi-asserted-by":"crossref","unstructured":"Fr\u00fchwirth, T.: A devil\u2019s advocate against termination of direct recursion. In: 17th International Symposium on Principles and Practice of Declarative Programming, PPDP 2015, Siena, Italy, 2015. ACM (2015)","DOI":"10.1145\/2790449.2790518"},{"issue":"3","key":"2_CR57","first-page":"303","volume":"1","author":"T Fr\u00fchwirth","year":"2001","unstructured":"Fr\u00fchwirth, T., Abdennadher, S.: The Munich rent advisor: A success for logic programming on the internet. TPLP 1(3), 303\u2013319 (2001)","journal-title":"TPLP"},{"key":"2_CR58","doi-asserted-by":"crossref","unstructured":"Fr\u00fchwirth, T., Abdennadher, S.: Essentials of Constraint Programming. Springer (2003)","DOI":"10.1007\/978-3-662-05138-2"},{"issue":"1","key":"2_CR59","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1109\/5254.820329","volume":"15","author":"T Fr\u00fchwirth","year":"2000","unstructured":"Fr\u00fchwirth, T., Brisset, P.: Placing base stations in wireless indoor communication networks. IEEE Intelligent Systems and Their Applications 15(1), 49\u201353 (2000)","journal-title":"IEEE Intelligent Systems and Their Applications"},{"key":"2_CR60","doi-asserted-by":"crossref","unstructured":"Fr\u00fchwirth, T., di Pierro, A., Wiklicky, H.: Probabilistic constraint handlingrules. In: 11th International Workshop on Functional and (Constraint) Logic Programming. ENTCS, vol. 76, pp. 115\u2013130 (2002)","DOI":"10.1016\/S1571-0661(04)80789-8"},{"key":"2_CR61","unstructured":"Fr\u00fchwirth, T., Holzbaur, C.: Source-to-source transformation for a class of expressive rules. In: Buccafurri, F. (ed.) Joint Conf. Declarative Programming APPIA-GULP-PRODE, AGP 2003, pp. 386\u2013397, September 2003"},{"key":"2_CR62","unstructured":"Fr\u00fchwirth, T., Raiser, F. (eds.) Constraint Handling Rules: Compilation, Execution, and Analysis. BOD (2011)"},{"key":"2_CR63","series-title":"Lecture Notes in Computer Science","volume-title":"Logic Programming","year":"2005","unstructured":"Gabbrielli, M., Gupta, G. (eds.): ICLP 2005. LNCS, vol. 3668. Springer, Heidelberg (2005)"},{"key":"2_CR64","doi-asserted-by":"publisher","first-page":"62","DOI":"10.1016\/j.ic.2013.05.001","volume":"228","author":"M Gabbrielli","year":"2013","unstructured":"Gabbrielli, M., Mauro, J., Meo, M.C.: The expressive power of CHR with priorities. Inf. Comput. 228, 62\u201382 (2013)","journal-title":"Inf. Comput."},{"key":"2_CR65","doi-asserted-by":"crossref","unstructured":"Gabbrielli, M., Mauro, J., Meo, M.C., Sneyers, J.: Decidability properties for fragments of CHR. In: Hermenegildo and Schaub [81], pp. 611\u2013626","DOI":"10.1017\/S1471068410000311"},{"issue":"2","key":"2_CR66","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/1462179.1462183","volume":"10","author":"M Gabbrielli","year":"2009","unstructured":"Gabbrielli, M., Meo, M.C.: A compositional semantics for CHR. ACM TOCL 10(2), 1\u201336 (2009)","journal-title":"ACM TOCL"},{"key":"2_CR67","doi-asserted-by":"crossref","unstructured":"Gabbrielli, M., Meo, M.C., Tacchella, P., Wiklicky, H.: Unfolding for CHR programs. Theory and Practice of Logic Programming, 1\u201348 (2013)","DOI":"10.1017\/S1471068413000288"},{"key":"2_CR68","unstructured":"Gall, D., Fr\u00fchwirth, T.: A formal semantics for the cognitive architecture ACT-R. [90]"},{"key":"2_CR69","doi-asserted-by":"crossref","unstructured":"Gall, D., Fr\u00fchwirth, T.: A refined operational semantics for ACT-R. In: 17th International Symposium on Principles and Practice of Declarative Programming, PPDP 2015, Siena, Italy, 2015. ACM (2015)","DOI":"10.1145\/2790449.2790517"},{"key":"2_CR70","series-title":"Lecture Notes in Computer Science","volume-title":"Logic Programming","year":"2008","unstructured":"Garcia de la Banda, M., Pontelli, E. (eds.): ICLP 2008. LNCS, vol. 5366. Springer, Heidelberg (2008)"},{"key":"2_CR71","doi-asserted-by":"crossref","unstructured":"Gavanelli, M., Alberti, M., Lamma, E.: Integrating abduction and constraint optimization in constraint handling rules. In: 18th European Conf. on Artif. Intell., ECAI 2008, pp. 903\u2013904. IOS press, July 2008","DOI":"10.3233\/978-1-58603-891-5-903"},{"key":"2_CR72","unstructured":"Geiselhart, F., Raiser, F., Sneyers, J., Fr\u00fchwirth, T.: MTSeq - multi-touch-enabled music generation and manipulation based on CHR. In: Van Weert and De Koninck [131]"},{"key":"2_CR73","unstructured":"Gerlich, R.: Generic and extensible automatic test data generation for safety critical software with CHR. In: Van Weert and De Koninck [131]"},{"key":"2_CR74","unstructured":"Gerlich, R.: Automatic test data generation and model checking with CHR. arXiv preprint arXiv:1406.2122 (2014)"},{"key":"2_CR75","unstructured":"Geurts, J., Ossenbruggen, J.V., Hardman, L.: Application-specific constraints for multimedia presentation generation. In: 8th International Conference on Multimedia Modeling, pp. 247\u2013266 (2001)"},{"key":"2_CR76","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/11603023_1","volume-title":"Practical Aspects of Declarative Languages","author":"S-D Gouraud","year":"2005","unstructured":"Gouraud, S.-D., Gotlieb, A.: Using CHRs to generate functional test cases for the Java card virtual machine. In: Van Hentenryck, P. (ed.) PADL 2006. LNCS, vol. 3819, pp. 1\u201315. Springer, Heidelberg (2005)"},{"key":"2_CR77","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-642-32925-8_1","volume-title":"Datalog in Academia and Industry","author":"TJ Green","year":"2012","unstructured":"Green, T.J., Aref, M., Karvounarakis, G.: LogicBlox, platform and language: a tutorial. In: Barcel\u00f3, P., Pichler, R. (eds.) Datalog 2.0 2012. LNCS, vol. 7494, pp. 1\u20138. Springer, Heidelberg (2012)"},{"issue":"4\u20135","key":"2_CR78","first-page":"593","volume":"11","author":"R Haemmerl\u00e9","year":"2011","unstructured":"Haemmerl\u00e9, R.: (Co-)Inductive semantics for Constraint Handling Rules. TPLP 11(4\u20135), 593\u2013609 (2011). Cambridge University Press","journal-title":"TPLP"},{"issue":"4\u20135","key":"2_CR79","doi-asserted-by":"publisher","first-page":"737","DOI":"10.1017\/S1471068412000270","volume":"12","author":"R Haemmerl\u00e9","year":"2012","unstructured":"Haemmerl\u00e9, R.: Diagrammatic confluence for Constraint Handling Rules. Theory Pract. Log. Program. 12(4\u20135), 737\u2013753 (2012)","journal-title":"Theory Pract. Log. Program."},{"key":"2_CR80","doi-asserted-by":"crossref","unstructured":"Haemmerl\u00e9, R., Lopez-Garcia, P., Hermenegildo, M.: CLP projection for constraint handling rules. In: Hanus, M. (ed.), PPDP 2011, pp. 137\u2013148. ACM Press, July 2011","DOI":"10.1145\/2003476.2003496"},{"key":"2_CR81","doi-asserted-by":"crossref","unstructured":"Hermenegildo, M., Schaub, T. (eds.) Proc. 26th Intl. Conf. Logic Programming, ICLP 2010. TPLP, vol. 10(4\u20136). Cambridge University Press, July 2010","DOI":"10.1017\/S1471068410000153"},{"issue":"4","key":"2_CR82","doi-asserted-by":"publisher","first-page":"369","DOI":"10.1080\/088395100117043","volume":"14","author":"C Holzbaur","year":"2000","unstructured":"Holzbaur, C., Fr\u00fchwirth, T.: A Prolog Constraint Handling Rules compiler and runtime system. Journal of Applied Artificial Intelligence 14(4), 369\u2013388 (2000). Taylor & Francis","journal-title":"Journal of Applied Artificial Intelligence"},{"issue":"4\u20135","key":"2_CR83","doi-asserted-by":"publisher","first-page":"503","DOI":"10.1017\/S1471068405002413","volume":"5","author":"C Holzbaur","year":"2005","unstructured":"Holzbaur, C., Garc\u00eda de la Banda, M., Stuckey, P.J., Duck, G.J.: Optimizing compilation of Constraint Handling Rules in HAL. Theory and Practice of Logic Programming 5(4\u20135), 503\u2013531 (2005). Cambridge University Press","journal-title":"Theory and Practice of Logic Programming"},{"key":"2_CR84","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"209","DOI":"10.1007\/978-3-540-74610-2_15","volume-title":"Logic Programming","author":"L De Koninck","year":"2007","unstructured":"De Koninck, L., Schrijvers, T., Demoen, B.: The correspondence between the logical algorithms language and CHR. In: Dahl, V., Niemel\u00e4, I. (eds.) ICLP 2007. LNCS, vol. 4670, pp. 209\u2013223. Springer, Heidelberg (2007)"},{"key":"2_CR85","doi-asserted-by":"crossref","unstructured":"Lam, E., Sulzmann, M.: Parallel execution of multi-set constraint rewrite rules. In: Tenth International ACM SIGPLAN Symposium on Principles and Practice of Declarative Programming. ACM (2008)","DOI":"10.1145\/1389449.1389453"},{"key":"2_CR86","first-page":"841","volume":"11","author":"ES Lam","year":"2009","unstructured":"Lam, E.S., Sulzmann, M.: Concurrent goal-based execution of Constraint Handling Rules. TPLP 11, 841\u2013879 (2009)","journal-title":"TPLP"},{"key":"2_CR87","series-title":"Lecture Notes in Computer Science","first-page":"51","volume-title":"Coordination Models and Languages","author":"ESL Lam","year":"2015","unstructured":"Lam, E.S.L., Cervesato, I., Fatima, N.: Comingle: distributed logic programming for decentralized mobile ensembles. In: Holvoet, T., Viroli, M. (eds.) COORDINATION 2015. LNCS, vol. 9037, pp. 51\u201366. Springer, Heidelberg (2015)"},{"key":"2_CR88","doi-asserted-by":"publisher","first-page":"195","DOI":"10.1007\/978-3-642-22836-0_14","volume-title":"Robotic Sailing","author":"J Langbein","year":"2011","unstructured":"Langbein, J., Stelzer, R., Fr\u00fchwirth, T.: A rule-based approach to long-term routing for autonomous sailboats. In: Schlaefer, A., Blaurock, O. (eds.) Robotic Sailing. Non-series, vol. 79, pp. 195\u2013204. Springer, Heidelberg (2011)"},{"issue":"10","key":"2_CR89","first-page":"1343","volume":"18","author":"E Mart\u0131nez-Mart\u0131n","year":"2012","unstructured":"Mart\u0131nez-Mart\u0131n, E., Escrig, M.T., del Pobil, A.P.: A general qualitative spatio-temporal model based on intervals. Journal of Universal Computer Science 18(10), 1343\u20131378 (2012)","journal-title":"Journal of Universal Computer Science"},{"key":"2_CR90","series-title":"Lecture Notes in Computer Science","volume-title":"Logic-Based Program Synthesis and Transformation","year":"2015","unstructured":"Proietti, M., Seki, H. (eds.): LOPSTR 2014. LNCS, vol. 8981. Springer, Heidelberg (2015)"},{"key":"2_CR91","doi-asserted-by":"crossref","unstructured":"Mauro, J.: Constraints Meet Concurrency. Springer (2014)","DOI":"10.2991\/978-94-6239-067-6"},{"key":"2_CR92","unstructured":"Meister, M.: Fine-grained parallel implementation of the preflow-push algorithm in CHR. In: Fink et al. [46], pp. 172\u2013181"},{"key":"2_CR93","unstructured":"Meister, M., Fr\u00fchwirth, T.: Reconstructing almost-linear tree equation solving algorithms in CHR. In: Proceedings of CSCLP 2007: Annual ERCIM Workshop on Constraint Solving and Constraint Logic Programming, p. 123 (2007)"},{"issue":"3","key":"2_CR94","doi-asserted-by":"crossref","first-page":"325","DOI":"10.3233\/FI-2010-310","volume":"102","author":"M Montali","year":"2010","unstructured":"Montali, M., Torroni, P., Chesani, F., Mello, P., Alberti, M., Lamma, E.: Abductive logic programming as an effective technology for the static verification of declarative business processes. Fundamenta Informaticae 102(3), 325\u2013361 (2010)","journal-title":"Fundamenta Informaticae"},{"key":"2_CR95","unstructured":"Pettorossi, A., Fioravanti, F., Proietti, M., De Angelis, E.: Program verification using constraint handling rules and array constraint generalizations. In: Second International Workshop on Verification and Program Transformation, VPT 2014, July 17\u201318, 2014, Vienna, Austria, vol. 28, pp. 3\u201318. EasyChair (2014)"},{"key":"2_CR96","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)"},{"key":"2_CR97","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)"},{"issue":"3","key":"2_CR98","doi-asserted-by":"publisher","first-page":"315","DOI":"10.1016\/S0164-1212(03)00076-1","volume":"70","author":"A Pretschner","year":"2004","unstructured":"Pretschner, A., L\u00f6tzbeyer, H., Philipps, J.: Model based testing in incremental system development. Journal of Systems and Software 70(3), 315\u2013329 (2004)","journal-title":"Journal of Systems and Software"},{"key":"2_CR99","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"240","DOI":"10.1007\/978-3-540-74610-2_17","volume-title":"Logic Programming","author":"F Raiser","year":"2007","unstructured":"Raiser, F.: Graph transformation systems in CHR. In: Dahl, V., Niemel\u00e4, I. (eds.) ICLP 2007. LNCS, vol. 4670, pp. 240\u2013254. Springer, Heidelberg (2007)"},{"key":"2_CR100","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"588","DOI":"10.1007\/978-3-540-85958-1_47","volume-title":"Principles and Practice of Constraint Programming","author":"F Raiser","year":"2008","unstructured":"Raiser, F.: Semi-automatic generation of CHR solvers for global constraints. In: Stuckey, P.J. (ed.) CP 2008. LNCS, vol. 5202, pp. 588\u2013592. Springer, Heidelberg (2008)"},{"key":"2_CR101","unstructured":"Raiser, F., Betz, H., Fr\u00fchwirth, T.: Equivalence of CHR states revisited. In: Raiser, F., Sneyers, J. (eds.), CHR 2009, pp. 33\u201348. K.U.Leuven, Dept. Comp. Sc., Technical report CW 555, July 2009"},{"key":"2_CR102","unstructured":"Raiser, F., Fr\u00fchwirth, T.: Towards term rewriting systems in constraint handling rules. In: Schrijvers, T., Raiser, F., Fr\u00fchwirth, T. (eds.) CHR 2008, pp. 19\u201334. RISC Report Series 08\u201310, University of Linz, Austria (2008)"},{"key":"2_CR103","unstructured":"Raiser, F., Fr\u00fchwirth, T.: Exhaustive parallel rewriting with multiple removals. In: Abdennadher, S. (ed.) WLP 2010, September 2010"},{"key":"2_CR104","unstructured":"Raiser, F., Tacchella, P.: On confluence of non-terminating CHR programs. In: Djelloul et al. [38], pp. 63\u201376"},{"issue":"3","key":"2_CR105","doi-asserted-by":"publisher","first-page":"238","DOI":"10.1504\/IJMSO.2010.034047","volume":"5","author":"I Salomie","year":"2010","unstructured":"Salomie, I., Chifu, V., Harsa, I., Gherga, M.: Web service composition using fluent calculus. International Journal of Metadata, Semantics and Ontologies 5(3), 238\u2013250 (2010)","journal-title":"International Journal of Metadata, Semantics and Ontologies"},{"key":"2_CR106","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"170","DOI":"10.1007\/978-3-540-69611-7_11","volume-title":"Practical Aspects of Declarative Languages","author":"B Sarna-Starosta","year":"2007","unstructured":"Sarna-Starosta, B., Ramakrishnan, C.R.: Compiling constraint handling rules for efficient tabled evaluation. In: Hanus, M. (ed.) PADL 2007. LNCS, vol. 4354, pp. 170\u2013184. Springer, Heidelberg (2007)"},{"issue":"2","key":"2_CR107","doi-asserted-by":"publisher","first-page":"207","DOI":"10.1142\/S0218194007003197","volume":"17","author":"B Sarna-Starosta","year":"2007","unstructured":"Sarna-Starosta, B., Stirewalt, R.E.K., Dillon, L.K.: A model-based design-for-verification approach to checking for deadlock in multi-threaded applications. Intl. Journal of Softw. Engin. and Knowl. Engin. 17(2), 207\u2013230 (2007)","journal-title":"Intl. Journal of Softw. Engin. and Knowl. Engin."},{"key":"2_CR108","unstructured":"Schiffel, S., Thielscher, M.: Fluxplayer: a successful general game player. In: 22nd Conference on Artificial Intelligence, pp. 1191\u20131196. AAAI Press (2007)"},{"key":"2_CR109","doi-asserted-by":"crossref","unstructured":"Schrijvers, T., Bruynooghe, M.: Polymorphic algebraic data type reconstruction. In: Eighth ACM SIGPLAN International Conference on Principles and Practice of Declarative Programming, pp. 85\u201396. ACM (2006)","DOI":"10.1145\/1140335.1140347"},{"key":"2_CR110","unstructured":"Schrijvers, T., Fr\u00fchwirth, T. (eds.) Proc. 3rd Workshop on Constraint Handling Rules, CHR 2006. K.U.Leuven, Dept. Comp. Sc., Technical report CW 452, July 2006"},{"issue":"1\u20132","key":"2_CR111","first-page":"213","volume":"6","author":"T Schrijvers","year":"2006","unstructured":"Schrijvers, T., Fr\u00fchwirth, T.: Optimal union-find in Constraint Handling Rules. TPLP 6(1\u20132), 213\u2013224 (2006)","journal-title":"TPLP"},{"key":"2_CR112","series-title":"Lecture Notes in Computer Science","volume-title":"Constraint Handling Rules \u2014 Current Research Topics","year":"2008","unstructured":"Schrijvers, T., Fr\u00fchwirth, T. (eds.): Constraint Handling Rules. LNCS, vol. 5388. Springer, Heidelberg (2008)"},{"key":"2_CR113","doi-asserted-by":"crossref","unstructured":"Schrijvers, T., Sulzmann, M.: Transactions in constraint handling rules. In: Garc\u00eda de la Banda and Pontelli [70], pp. 516\u2013530","DOI":"10.1007\/978-3-540-89982-2_44"},{"key":"2_CR114","unstructured":"Seitz, C., Bauer, B., Berger, M.: Multi agent systems using constraint handling rules for problem solving. In: International Conference on Artificial Intelligence, pp. 295\u2013301. CSREA Press (2002)"},{"key":"2_CR115","doi-asserted-by":"crossref","unstructured":"Sneyers, J.: Turing-complete subclasses of CHR. In: Garc\u00eda de la Banda and Pontelli [70], pp. 759\u2013763","DOI":"10.1007\/978-3-540-89982-2_72"},{"key":"2_CR116","unstructured":"Sneyers, J., De Schreye, D.: APOPCALEAPS: automatic music generation with CHRiSM. In: Danoy, G. et al., (eds.) 22nd Benelux Conference on Artificial Intelligence (BNAIC 2010), Luxembourg, October 2010"},{"issue":"4\u20135","key":"2_CR117","doi-asserted-by":"publisher","first-page":"769","DOI":"10.1017\/S1471068413000483","volume":"13","author":"J Sneyers","year":"2013","unstructured":"Sneyers, J., De Schreye, D., Fr\u00fchwirth, T.: Probabilistic legal reasoning in CHRiSM. Theory and Practice of Logic Programming 13(4\u20135), 769\u2013781 (2013)","journal-title":"Theory and Practice of Logic Programming"},{"issue":"4\u20136","key":"2_CR118","doi-asserted-by":"publisher","first-page":"433","DOI":"10.1017\/S1471068410000207","volume":"10","author":"J Sneyers","year":"2010","unstructured":"Sneyers, J., Meert, W., Vennekens, J., Kameya, Y., Sato, T.: Chr (PRISM)-based probabilistic logic learning. Theory and Practice of Logic Programming 10(4\u20136), 433\u2013447 (2010)","journal-title":"Theory and Practice of Logic Programming"},{"key":"2_CR119","unstructured":"Sneyers, J., Schrijvers, T., Demoen, B.: Dijkstra\u2019s algorithm with Fibonacci heaps: an executable description in CHR. In: Fink et al. [46], pp. 182\u2013191"},{"key":"2_CR120","doi-asserted-by":"crossref","unstructured":"Sneyers, J., Schrijvers, T., Demoen, B.: The computational power and complexity of Constraint Handling Rules. ACM TOPLAS 31(2), February 2009","DOI":"10.1145\/1462166.1462169"},{"key":"2_CR121","unstructured":"Sneyers, J., Van Weert, P., Schrijvers, T.: Aggregates for constraint handling rules. In: Djelloul et al. [38], pp. 91\u2013105"},{"issue":"1","key":"2_CR122","first-page":"1","volume":"10","author":"J Sneyers","year":"2010","unstructured":"Sneyers, J., Van Weert, P., Schrijvers, T., De Koninck, L.: As time goes by: Constraint Handling Rules - A survey of CHR research between 1998 and 2007. TPLP 10(1), 1\u201347 (2010)","journal-title":"TPLP"},{"key":"2_CR123","doi-asserted-by":"crossref","unstructured":"Sobhi, I., Abdennadher, S., Betz, H.: Constructing rule-based solvers for intentionally-defined constraints. In: Schrijvers and Fr\u00fchwirth [112], pp. 70\u201384","DOI":"10.1007\/978-3-540-92243-8_4"},{"issue":"6","key":"2_CR124","doi-asserted-by":"publisher","first-page":"1216","DOI":"10.1145\/1108970.1108974","volume":"27","author":"PJ Stuckey","year":"2005","unstructured":"Stuckey, P.J., Sulzmann, M.: A Theory of Overloading. ACM Transactions on Programming Languages and Systems 27(6), 1216\u20131269 (2005)","journal-title":"ACM Transactions on Programming Languages and Systems"},{"issue":"1","key":"2_CR125","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1017\/S0956796806006137","volume":"17","author":"M Sulzmann","year":"2007","unstructured":"Sulzmann, M., Duck, G.J., Peyton-Jones, S., Stuckey, P.J.: Understanding functional dependencies via Constraint Handling Rules. J. Functional Prog. 17(1), 83\u2013129 (2007)","journal-title":"J. Functional Prog."},{"key":"2_CR126","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. Theory and Practice of Logic Programming 5, 533\u2013565 (2005)","journal-title":"Theory and Practice of Logic Programming"},{"key":"2_CR127","unstructured":"Thielscher, M.: Reasoning robots: the art and science of programming robotic agents, vol. 33. Springer Science & Business Media (2006)"},{"key":"2_CR128","doi-asserted-by":"crossref","unstructured":"Triossi, A., Orlando, S., Raffaet\u00e0, A., Fr\u00fchwirth, T.: Compiling chr to parallel hardware. In: Proceedings of the 14th symposium on Principles and practice of declarative programming, pp. 173\u2013184. ACM (2012)","DOI":"10.1145\/2370776.2370798"},{"key":"2_CR129","unstructured":"Van Weert, P.: Compiling Constraint Handling Rules to Java: A reconstruction. Technical Report CW 521, K.U.Leuven, Dept. Comp. Sc., Leuven, Belgium, August 2008"},{"issue":"11","key":"2_CR130","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 Transactions on Knowledge and Data Engineering 22(11), 1521\u20131534 (2010)","journal-title":"IEEE Transactions on Knowledge and Data Engineering"},{"key":"2_CR131","unstructured":"Van Weert, P., De Koninck, L. (eds.) Proc. 7th Workshop on Constraint Handling Rules, CHR 2010. K.U.Leuven, Dept. Comp. Sc., Technical report CW 588, July 2010"},{"key":"2_CR132","unstructured":"Van Weert, P., Sneyers, J., Schrijvers, T., Demoen, B.: Extending CHR with negation as absence. In: Schrijvers and Fr\u00fchwirth [110], pp. 125\u2013140"},{"key":"2_CR133","doi-asserted-by":"crossref","unstructured":"Van Weert, P., Wuille, P., Schrijvers, T., Demoen, B.: CHR for imperative host languages. In: Schrijvers and Fr\u00fchwirth [112], pp. 161\u2013212","DOI":"10.1007\/978-3-540-92243-8_7"},{"issue":"4\u20135","key":"2_CR134","doi-asserted-by":"publisher","first-page":"567","DOI":"10.1017\/S1471068405002383","volume":"5","author":"A Wolf","year":"2005","unstructured":"Wolf, A.: Intelligent search strategies based on adaptive Constraint Handling Rules. Theory and Practice of Logic Programming 5(4\u20135), 567\u2013594 (2005)","journal-title":"Theory and Practice of Logic Programming"},{"key":"2_CR135","doi-asserted-by":"crossref","unstructured":"Wolf, A., Robin, J., Vitorino, J.: Adaptive CHR meets CHR$$^\\vee $$: an extended refined operational semantics for CHR$$^\\vee $$ based on justifications. In: Schrijvers and Fr\u00fchwirth [112], pp. 48\u201369","DOI":"10.1007\/978-3-540-92243-8_3"},{"key":"2_CR136","unstructured":"Wuille, P., Schrijvers, T., Demoen, B.: CCHR: the fastest CHR implementation. In: Djelloul, C. et al. [38], pp. 123\u2013137"},{"key":"2_CR137","unstructured":"Zaki, A., Fr\u00fchwirth, T., Geller, I.: Parallel execution of constraint handling rules on a graphical processing unit. In: Sneyers, J., Fr\u00fchwirth, T. (eds.) CHR 2012, pp. 82\u201390. K.U.Leuven, Dept. Comp. Sc., Technical report CW 624, September 2012"},{"issue":"4","key":"2_CR138","doi-asserted-by":"publisher","first-page":"319","DOI":"10.1504\/IJEB.2008.020672","volume":"6","author":"H Zhu","year":"2008","unstructured":"Zhu, H., Madnick, S.E., Siegel, M.D.: Enabling global price comparison through semantic integration of web data. IJEB 6(4), 319\u2013341 (2008)","journal-title":"IJEB"}],"container-title":["Lecture Notes in Computer Science","Rule Technologies: Foundations, Tools, and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-21542-6_2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,29]],"date-time":"2025-05-29T04:07:32Z","timestamp":1748491652000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-21542-6_2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783319215419","9783319215426"],"references-count":138,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-21542-6_2","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015]]},"assertion":[{"value":"12 July 2015","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}