As time goes by: Constraint handling rules

Theory and Practice of Logic Programming

Volumn 10, Issue 1, 2010, Pages 1-47

  Sneyers, J ^a   Van Weert, Peter ^a   Schrijvers, Tom ^a   Koninck, De Leslie ^a  

^a UNIVERSITY OF LEUVEN   (Belgium)

Author keywords

Constraint Handling Rules (CHR); Survey

Indexed keywords

CONSTRAINT HANDLING RULES; CONSTRAINT HANDLING RULES (CHR); CONSTRAINT LOGIC PROGRAMMING; CONSTRAINT SOLVERS; GENERAL PURPOSE LANGUAGES; HIGH-LEVEL PROGRAMMING LANGUAGE; MULTISET; RESEARCH AREAS; REWRITE RULES;

HIGH LEVEL LANGUAGES; LINGUISTICS; LOGIC PROGRAMMING;

SURVEYS;

EID: 77951219874     PISSN: 14710684     EISSN: 14753081     Source Type: Journal    
DOI: 10.1017/S1471068409990123     Document Type: Review

References (199)

1. Abdennadher, S. 2000. A language for experimenting with declarative paradigms. In RCoRP '00(bis): Proc. 2nd Workshop on Rule-Based Constraint Reasoning and Programming, T. Frühwirth et al., Eds.
2. Abdennadher, S. 2001. Rule-based constraint programming: Theory and practice. Habilitationsschrift. Institute of Computer Science, LMU, Munich, Germany.
3. Abdennadher, S. and Christiansen, H. 2000. An experimental CLP platform for integrity constraints and abduction. In FQAS '00: Proc. 4th Intl. Conf. Flexible Query Answering Systems, H. L. Larsen, J. Kacprzyk, S. Zadrozny, T. Andreasen, and H. Christiansen, Eds. Springer, 141-152.
4. Abdennadher, S. and Frühwirth, T. 1998. On completion of Constraint Handling Rules. In CP '98, M. J. Maher and J.-F. Puget, Eds. LNCS, vol.1520. Springer, 25-39
5. Abdennadher, S. and Frühwirth, T. 1999. Operational equivalence of CHR programs and constraints. In CP '99, J. Jaffar, Ed. LNCS, vol.1713. Springer, 43-57.
6. Abdennadher, S. and Frühwirth, T. 2004. Integration and optimization of rule-based constraint solvers. In LOPSTR '03, M. Bruynooghe, Ed. LNCS, vol.3018. Springer, 198-213. (Pubitemid 38939957)
7. Abdennadher, S., Frühwirth, T. and Holzbaur, C., Eds. 2005. Special Issue on Constraint Handling Rules. Theory and Practice of Logic Programming, vol.5(4-5).
8. Abdennadher, S., Frühwirth, T. and Meuss, H. 1999. Confluence and semantics of constraint simplification rules. Constraints 4, 2, 133-165. (Pubitemid 129579190)
9. Abdennadher, S., Krämer, E., Saft, M. and Schmauß, M. 2002. JACK: A Java Constraint Kit. In WFLP '01: Proc. 10th Intl. Workshop on Functional and (Constraint) Logic Programming, Selected Papers, M. Hanus, Ed. ENTCS, vol.64. Elsevier, 1-17. See also URL: http://pms.ifi.lmu.de/software/ jack/.
10. Abdennadher, S. and Marte, M. 2000. University course timetabling using Constraint Handling Rules. In Holzbaur and Frühwirth (2000b), 311-325. (Pubitemid 35394302)
11. Abdennadher, S., Olama, A., Salem, N. and Thabet, A. 2006. ARM: Automatic rule miner. In LOPSTR '06, Revised Selected Papers, G. Puelda, Ed. LNCS, vol.4407. Springer
12. Abdennadher, S. and Rigotti, C. 2004. Automatic generation of rule-based constraint solvers over finite domains. ACM TOCL 5, 2, 177-205.
13. Abdennadher, S. and Rigotti, C. 2005. Automatic generation of CHR constraint solvers. In Abdennadher et al. (2005), 403-418. (Pubitemid 41049855)
14. Abdennadher, S. and Saft, M. 2001. A visualization tool for Constraint Handling Rules. In WLPE '01, A. Kusalik, Ed.
15. Abdennadher, S., Saft, M. and Will, S. 2000. Classroom assignment using constraint logic programming. In PACLP '00: Proc. 2nd Intl. Conf. and Exhibition on Practical Application of Constraint Technologies and Logic Programming.
16. V, a flexible query language. In FQAS '98: Proc. 3rd Intl. Conf. on Flexible Query Answering Systems, T. Andreasen, H. Christiansen and H. Larsen, Eds. LNAI, vol.1495. Springer, 1-14.
17. Abdennadher, S. and Sobhi, I. 2008. Generation of rule-based constraint solvers: Combined approach. In LOPSTR '07, Revised Selected Papers, A. King, Ed. LNCS, vol.4915. Springer.
18. Aguilar-Solis, D. and Dahl, V. 2004. Coordination revisited -a Constraint Handling Rule approach. In IBERAMIA '04: Proc. 9th Ibero-American Conf. on AI, C. Lemaitre, C. A. Reyes, and J. A. Gonzalez, Eds. LNCS, vol.3315. Springer. 315-324. (Pubitemid 41050548)
19. Alberti, M., Chesani, F., Gavanelli, M. and Lamma, E. 2005. The CHR-based implementation of a system for generation and confirmation of hypotheses. In Wolf et al. (2005), 111-122.
20. Alberti, M., Daolio, D., Torroni, P., Gavanelli, M., Lamma, E. and Mello, P. 2004. Specification and verification of agent interaction protocols in a logic-based system. In SAC '04: Proc. 19th ACM Symp. Applied Computing, H. Haddad et al., Eds. ACM Press, 72-78.
21. Alberti, M., Gavanelli, M., Lamma, E., Chesani, F., Mello, P. and Torroni, P. 2006. Compliance verification of agent interaction: A logic-based software tool. Applied Artificial Intelligence 20, 2-4, 133-157.
22. Alberti, M., Gavanelli, M., Lamma, E., Mello, P. and Milano, M. 2005. A CHR-based implementation of known arc-consistency. In Abdennadher et al. (2005), 419-440. (Pubitemid 41049856)
23. Alberti, M., Gavanelli, M., Lamma, E., Mello, P. and Torroni, P. 2004. Specification and verification of agent interaction using social integrity constraints. In LCMAS'03: Logic and Communication in Multi-Agent Systems. ENTCS, vol.85(2). Elsevier, 94-116. (Pubitemid 40672138)
24. Alves, S. and Florido, M. 2002. Type inference using Constraint Handling Rules. In WFLP '01: Proc. 10th Intl. Workshop on Functional and (Constraint) Logic Programming, Selected Papers, M. Hanus, Ed. ENTCS, vol.64. Elsevier, 56-72.
25. Apt, K. R. and Monfroy, E. 2001. Constraint programming viewed as rule-based programming. TPLP 1, 6, 713-750.
26. Badea, L., Tilivea, D. and Hotaran, A. 2004. Semantic Web Reasoning for Ontology-Based Integration of Resources. In PPSWR '04: Workshop on Principles And Practice Of Semantic Web Reasoning, H. J. Ohlbach, S. Schaffert, Eds. LNCS, vol.3208. Springer, 61-75. (Pubitemid 39744161)
27. Barranco-Mendoza, A. 2005. Stochastic and heuristic modelling for analysis of the growth of pre-invasive lesions and for a multidisciplinary approach to early cancer diagnosis. Ph.D. thesis, Simon Fraser University, Canada.
28. Bavarian, M. and Dahl, V. 2006. Constraint based methods for biological sequence analysis. Journal of Universal Computer Science 12, 11, 1500-1520.
29. B̀es, G. G. and Dahl, V. 2003. Balanced parentheses in NL texts: A useful cue in the syntax/semantics interface. In Proc. Lorraine-Saarland Workshop on Prospects and Advances in the Syntax/Semantics Interface. Poster Paper.
30. Betz, H. 2007. Relating coloured Petri nets to Constraint Handling Rules. In Djelloul et al. (2007), 33-47.
31. Betz, H. and Frühwirth, T. 2005. A linear-logic semantics for Constraint Handling Rules. In CP '05, P. van Beek, Ed. LNCS, vol.3709. Springer, 137-151.
32. Betz, H. and Frühwirth, T. 2007. A linear-logic semantics for Constraint Handling Rules with disjunction. In Djelloul et al. (2007), 17-31.
33. Bistarelli, S., Frühwirth, T., Marte, M. and Rossi, F. 2004. Soft constraint propagation and solving in Constraint Handling Rules. Computational Intelligence: Special Issue on P in AI and CP 20, 2 (May), 287-307.
34. Boespflug, M. 2007. TaiChi: How to check your types with serenity. The Monad. Reader 9, 17-31.
35. Bouissou, O. 2004. A CHR Library for SiLCC. Diploma Thesis. Technical University of Berlin, Germany.
36. Brand, S. 2002. A note on redundant rules in rule-based constraint programming. In Joint ERCIM/CologNet Intl. Workshop on Constraint Solving and Constraint Logic Programming, Selected papers. LNCS, vol.2627. Springer, 279-336.
37. Brand, S. and Monfroy, E. 2003. Deductive generation of constraint propagation rules. In RULE '03: 4th Intl. Workshop on Rule-Based Programming, G. Vidal, Ed. ENTCS, vol.86 (2). Elsevier, 45-60.
38. Bressan, S. and Goh, C. H. 1998. Answering queries in context. In FQAS '98: Proc. 3rd Intl. Conf. on Flexible Query Answering Systems, T. Andreasen, H. Christiansen and H. Larsen, Eds. LNAI, vol.1495. Springer, 68-82. (Pubitemid 128144070)
39. Cabedo, L. M. and Escrig, M. T. 2003. Modeling motion by the integration of topology and time. Journal of Universal Computer Science 9, 9, 1096-1122.
40. Chin, W.-N., Craciun, F., Khoo, S.-C. and Popeea, C. 2006. A flow-based approach for variant parametric types. SIGPLAN Not. 41, 10, 273-290. (Pubitemid 44643680)
41. Chin, W.-N., Sulzmann, M. and Wang, M. 2003. A Type-Safe Embedding of Constraint Handling Rules into Haskell. Honors Thesis. School of Computing, National University of Singapore.
42. Christiansen, H. 2005. CHR grammars. In Abdennadher et al. (2005), 467-501.
43. Christiansen, H. 2006. On the implementation of global abduction. In CLIMA '06: 7th Intl. Workshop on Computational Logic in Multi-Agent Systems -Revised, Selected and Invited Papers, K. Inoue, K. Satoh and F. Toni, Eds. LNCS, vol.4371. Springer, 226-245.
44. Christiansen, H. and Dahl, V. 2003. Logic grammars for diagnosis and repair. International Journal of Artificial Intelligence Tools 12, 3, 227-248. (Pubitemid 37077232)
45. Christiansen, H. and Dahl, V. 2005a. HYPROLOG: A new logic programming language with assumptions and abduction. In Gabbrielli and Gupta (2005), 159-173.
46. Christiansen, H. and Dahl, V. 2005b. Meaning in context. In CONTEXT '05: Proc. 4th Intl. and Interdisciplinary Conf. Modeling and Using Context, J. G. Carbonell and J. Siekmann, Eds. LNAI, vol.3554. Springer, 97-111.
47. Christiansen, H. and Have, C. T. 2007. From use cases to UML class diagrams using logic grammars and constraints. In RANLP '07: Proc. Intl. Conf. Recent Adv. Nat. Lang. Processing. 128-132.
48. Christiansen, H. and Martinenghi, D. 2000. Symbolic constraints for meta-logic programming. In Holzbaur and Frühwirth (2000b), 345-367.
49. Coquery, E. and Fages, F. 2003. TCLP: A type checker for CLP(X). In WLPE '03, F. Mesnard and A. Serebrenik, Eds. K.U.Leuven, Department of Computer Science, Technical report CW 371. 17-30.
50. Coquery, E. and Fages, F. 2005. A type system for CHR. In Schrijvers and Frühwirth (2005b), 19-33.
51. Dahl, V. 2004. An abductive treatment of long distance dependencies in CHR. In CSLP '04: Proc. First Intl. Workshop on Constraint Solving and Language Processing, H. Christiansen, P. R. Skadhauge, and J. Villadsen, Eds. LNCS, vol.3438. Springer, 17-31. Invited Paper.
52. Dahl, V. and Blache, P. 2005. Extracting selected phrases through constraint satisfaction. In Proc. 2nd Intl. Workshop on Constraint Solving and Language Processing.
53. Dahl, V. and Gu, B. 2006. Semantic property grammars for knowledge extraction from biomedical text. In Etalle and Truszczynski (2006), 442-443. Poster Paper.
54. Dahl, V. and Gu, B. 2007. A CHRG analysis of ambiguity in biological texts. In CSLP '07: Proc. 4th Intl. Workshop on Constraints and Language Processing. Extended Abstract.
55. Dahl, V. and Niemelä, I., Eds. 2007. ICLP '07: Proc. 23rd Intl. Conf. Logic Programming. LNCS, vol.4670. Springer.
56. Dahl, V. and Voll, K. 2004. Concept formation rules: An executable cognitive model of knowledge construction. In NLUCS '04: Proc. First Intl. Workshop on Natural Language Understanding and Cognitive Sciences, H. Christiansen and J. Villadsen, Eds. Computer Science technical report no. 113, Roskilde University.
57. De Koninck, L., Schrijvers, T. and Demoen, B. 2006a. INCLP(IR )-Interval-based nonlinear constraint logic programming over the reals. In Fink et al. (2006), 91-100.
58. De Koninck, L., Schrijvers, T. and Demoen, B. 2006b. Search strategies in CHR(Prolog). In Schrijvers and Frühwirth (2006), 109-123.
59. De Koninck, L., Schrijvers, T. and Demoen, B. 2007a. The correspondence between the Logical Algorithms language and CHR. In Dahl and Niemelä (2007), 209-223.
60. De Koninck, L., Schrijvers, T. and Demoen, B. 2007b. User-definable rule priorities for CHR. In PPDP '07, M. Leuschel and A. Podelski, Eds. ACM Press, 25-36. (Pubitemid 47291458)
61. De Koninck, L. and Sneyers, J. 2007. Join ordering for Constraint Handling Rules. In Djelloul et al. (2007), 107-121.
62. De Koninck, L., Stuckey, P. J. and Duck, G. J. 2008. Optimizing compilation of CHR with rule priorities. In Proc. 9th Intl. Symp. Functional and Logic Programming, J. Garrigue and M. Hermenegildo, Eds. LNCS, vol.4989. Springer, 32-47. (Pubitemid 351642018)
63. Delzanno, G., Gabbrielli, M. and Meo, M. C. 2005. A compositional semantics for CHR. In PPDP '05, P. Barahona and A. Felty, Eds. ACM Press, 209-217. (Pubitemid 44074003)
64. Demoen, B. and Lifschitz, V., Eds. 2004. ICLP '04: Proc. 20th Intl. Conf. Logic Programming. LNCS, vol.3132. Springer.
65. Djelloul, K., Dao, T.-B.-H. and Frühwirth, T. 2007. Toward a first-order extension of Prolog's unification using CHR: A CHR first-order constraint solver over finite or infinite trees. In SAC '07: Proc. 2007 ACM Symp. Applied computing, Y. Cho, R. L. Wainwright, H. Haddad, S. Y. Shin, and Y. W. Koo, Eds. ACM Press, 58-64. (Pubitemid 47568254)
66. Djelloul, K., Duck, G. J. and Sulzmann, M., Eds. 2007. CHR '07: Proc. 4th Workshop on Constraint Handling Rules.
67. Ducasś e, M. 1999. Opium: an extendable trace analyzer for Prolog. J. Logic Programming 39, 1-3, 177-223.
68. Duck, G. J. 2005. Compilation of Constraint Handling Rules. Ph.D. thesis, University of Melbourne, Victoria, Australia.
69. Duck, G. J. and Schrijvers, T. 2005. Accurate functional dependency analysis for Constraint Handling Rules. In Schrijvers and Frühwirth (2005b), 109-124.
70. Duck, G. J., Stuckey, P. J. and Brand, S. 2006. ACD term rewriting. In Etalle and Truszczynski (2006), 117-131.
71. Duck, G. J., Stuckey, P. J., García de la Banda, M. and Holzbaur, C. 2003. Extending arbitrary solvers with Constraint Handling Rules. In PPDP '03. ACM Press, 79-90.
72. Duck, G. J., Stuckey, P. J., García de la Banda, M. and Holzbaur, C. 2004. The refined operational semantics of Constraint Handling Rules. In Demoen and Lifschitz (2004), 90-104.
73. Duck, G. J., Stuckey, P. J. and Sulzmann, M. 2007. Observable confluence for Constraint Handling Rules. In Dahl and Niemelä (2007), 224-239.
74. Escrig, M. T. and Toledo, F. 1998a. A framework based on CLP extended with CHRs for reasoning with qualitative orientation and positional information. J. Visual Languages and Computing 9, 1, 81-101. (Pubitemid 128180583)
75. Escrig, M. T. and Toledo, F. 1998b. Qualitative Spatial Reasoning: Theory and Practice-Application to Robot Navigation. IOS Press.
76. Etalle, S. and Truszczynski, M., Eds. 2006. ICLP '06: Proc. 22nd Intl. Conf. Logic Programming. LNCS, vol.4079. Springer.
77. Fink, M., Tompits, H. and Woltran, S., Eds. 2006. WLP '06: Proc. 20th Workshop on Logic Programming. T. U. Wien, Austria, INFSYS Research report 1843-06-102
78. Firat, A. 2003. Information Integration Using Contextual Knowledge and Ontology Merging. Ph.D. Thesis, MIT Sloan School of Management, Cambridge, MA, USA.
79. Frühwirth, T. 1992. Constraint Simplification Rules. Tech. Rep. ECRC-92-118, European Computer-Industry Research Centre, Munich, Germany.
80. Frühwirth, T. 1995. Constraint handling rules. In Constraint Programming: Basic and Trends-Selected Papers of the 22nd Spring School in Theoretical Computer Sciences, May 16-20, 1994, A. Podelski, Ed. LNCS, vol.910. Springer, 90-107.
81. Frühwirth, T. 1998. Theory and practice of Constraint Handling Rules. Journal of Logic Programming, Special Issue on Constraint Logic Programming 37, 1-3, 95-138. (Pubitemid 128415802)
82. Frühwirth, T. 2000. Proving termination of constraint solver programs. In New Trends in Constraints, Joint ERCIM/Compulog Net Workshop, October 1999, Selected papers, K. Apt, A. Kakas, E. Monfroy and F. Rossi, Eds. LNCS, vol.1865. Springer, 298-317.
83. Frühwirth, T. 2001. On the number of rule applications in constraint programs. In Declarative Programming-Selected Papers from AGP 2000, A. Dovier, M. C. Meo and A. Omicini, Eds. ENTCS, vol.48. Elsevier, 147-166. (Pubitemid 40715780)
84. Frühwirth, T. 2002a. As time goes by: Automatic complexity analysis of simplification rules. In KR '02: Proc. 8th Intl. Conf. Princ. Knowledge Representation and Reasoning, D. Fensel, F. Giunchiglia, D. McGuinness and M.-A. Williams, Eds. Morgan Kaufmann, 547-557. (Pubitemid 41155301)
85. Frühwirth, T. 2002b. As time goes by II: More automatic complexity analysis of concurrent rule programs. In QAPL '01: Proc. First Intl. Workshop on Quantitative Aspects of Programming Languages, A. D. Pierro and H. Wiklicky, Eds. ENTCS, vol.59(3). Elsevier.
86. Frühwirth, T. 2005a. Logical rules for a lexicographic order constraint solver. In Schrijvers and Frühwirth (2005b), 79-91.
87. Frühwirth, T. 2005b. Parallelizing union-find in Constraint Handling Rules using confluence. In Gabbrielli and Gupta (2005), 113-127.
88. Frühwirth, T. 2005c. Specialization of concurrent guarded multi-set transformation rules. In LOPSTR '04, S. Etalle, Ed. LNCS, vol.3573. Springer, 133-148.
89. Frühwirth, T. 2006a. Complete propagation rules for lexicographic order constraints over arbitrary domains. In Recent Advances in Constraints, CSCLP '05: Joint ERCIM/CoLogNET Intl. Workshop on Constraint Solving and CLP, Revised Selected and Invited Papers. LNAI, vol.3978. Springer.
90. Frühwirth, T. 2006b. Deriving linear-time algorithms from union-find in CHR. In Schrijvers and Frühwirth (2006), 49-60.
91. Frühwirth, T. 2007. Description logic and rules the CHR way. In Djelloul et al. (2007), 49-61.
92. Frühwirth, T. 2009. Constraint Handling Rules. Cambridge University Press.
93. Frühwirth, T. et al., Eds. 2000. RCoRP '00: Proc. 1st Workshop on Rule-Based Constraint Reasoning and Programming.
94. Frühwirth, T. and Abdennadher, S. 2001. The Munich rent advisor: A success for logic programming on the internet. The Journal of Theory and Practice of Logic Programming 1, 3, 303-319. (Pubitemid 33684567)
95. Frühwirth, T. and Abdennadher, S. 2003. Essentials of Constraint Programming. Springer.
96. Frühwirth, T. and Brisset, P. 1995. High-Level Implementations of Constraint Handling Rules. Tech. Rep. ECRC-95-120, European Computer-Industry Research Centre.
97. Frühwirth, T. and Brisset, P. 1998. Optimal placement of base stations in wireless indoor telecommunication. In CP '98, M. J. Maher and J.-F. Puget, Eds. LNCS, vol.1520. Springer, 476-480. (Pubitemid 128151619)
98. Frühwirth, T. and Brisset, P. 2000. Placing base stations in wireless indoor communication networks. IEEE Intelligent Systems and Their Applications 15, 1, 49-53. (Pubitemid 30564497)
99. Frühwirth, T., Di Pierro, A. and Wiklicky, H. 2002. Probabilistic Constraint Handling Rules. In WFLP '02: Proc. 11th Intl. Workshop on Functional and (Constraint) Logic Programming, Selected Papers, M. Comini and M. Falaschi, Eds. ENTCS, vol.76. Elsevier.
100. Frühwirth, T. and Holzbaur, C. 2003. Source-to-source transformation for a class of expressive rules. In AGP '03: Joint Conf. Declarative Programming APPIA-GULP-PRODE, F. Buccafurri, Ed. 386-397.
101. Frühwirth, T. and Meister, M., Eds. 2004. CHR '04: 1st Workshop on Constraint Handling Rules: Selected Contributions.
102. Gabbrielli, M. and Gupta, G., Eds. 2005. ICLP '05: Proc. 21st Intl. Conf. Logic Programming. LNCS, vol.3668. Springer.
103. Gabbrielli, M. and Meo, M. C. 2009. A compositional semantics for CHR. ACM Transactions on Computational Logic 10, 2.
104. Ganzinger, H. and McAllester, D. A. 2002. Logical algorithms. In Stuckey (2002), 209-223.
105. Garat, D. and Wonsever, D. 2002. A constraint parser for contextual rules. In Proc. 22nd Intl. Conf. of the Chilean Computer Science Society. IEEE Computer Society, 234-242.
106. Gavanelli, M., Lamma, E., Mello, P., et al. 2003. Interpreting abduction in CLP. In AGP '03: Joint Conf. Declarative Programming APPIA-GULP-PRODE, F. Buccafurri, Ed. 25-35.
107. Geurts, J., van Ossenbruggen, J. and Hardman, L. 2001. Application-specific constraints for multimedia presentation generation. In MMM '01: Proc. 8th Intl. Conf. on Multimedia Modeling. 247-266.
108. Gouraud, S.-D. and Gotlieb, A. 2006. Using CHRs to generate functional test cases for the Java card virtual machine. In PADL '06: Proc. 8th Intl. Symp. Practical Aspects of Declarative Languages, P. Van Hentenryck, Ed. LNCS, vol.3819. Springer, 1-15.
109. Haemmerĺ e, R. and Fages, F. 2007. Abstract critical pairs and confluence of arbitrary binary relations. In RTA '07: Proc. 18th Intl. Conf. Term Rewriting and Applications. LNCS, vol.4533. Springer.
110. Hanus, M. 2006. Adding Constraint Handling Rules to Curry. In Fink et al. (2006), 81-90.
111. Hecksher, T., Nielsen, S. T. and Pigeon, A. 2002. A CHRG model of the ancient Egyptian grammar. Unpublished student project report, Roskilde University, Denmark.
112. Holzbaur, C. and Frühwirth, T. 1998. Constraint Handling Rules Reference Manual, Release 2.2. Tech. Rep. TR-98-101, Österreichisches Forschungsinstitut für Artificial Intelligence, Wien.
113. Holzbaur, C. and Frühwirth, T. 1999. Compiling Constraint Handling Rules into prolog with attributed variables. In PPDP '99, G. Nadathur, Ed. LNCS, vol.1702. Springer, 117-133.
114. Holzbaur, C. and Frühwirth, T. 2000a. A Prolog Constraint Handling Rules compiler and runtime system. Journal of Applied Artificial Intelligence 14(4), 369-388.
115. Holzbaur, C. and Frühwirth, T., Eds. 2000b. Special issue on Constraint Handling Rules. Journal of Applied Artificial Intelligence 14 (4).
116. Holzbaur, C., García de la Banda, M., Stuckey, P. J. and Duck, G. J. 2005. Optimizing compilation of Constraint Handling Rules in HAL. In Abdennadher et al. (2005), 503-531.
117. Käser, M. and Meister, M. 2006. Implementation of an F-Logic kernel in CHR. In Schrijvers and Frühwirth (2006), 33-47.
118. Kosmatov, N. 2006a. A constraint solver for sequences and its applications. In Proc. 2006 ACM Symp. on Applied Computing. ACM Press, 404-408.
119. Kosmatov, N. 2006b. Constraint solving for sequences in software validation and verification. In INAP '05: Proc. 16th Intl. Conf. Applications of Declarative Programming and Knowledge Management. LNCS, vol.4369. Springer, 25-37.
120. Krämer, E. 2001. A generic search engine for a Java Constraint Kit. Diplomarbeit. Institute of Computer Science, LMU, Munich, Germany.
121. Lam, E. S. and Sulzmann, M. 2006. Towards agent programming in CHR. In Schrijvers and Frühwirth (2006), 17-31.
122. Lam, E. S. and Sulzmann, M. 2007. A concurrent Constraint Handling Rules semantics and its implementation with software transactional memory. In DAMP '07: Proc. ACM SIGPLAN Workshop on Declarative Aspects of Multicore Programming. ACM Press. System's homepage at URL: http://taichi.ddns.comp.nus.edu.sg/ taichiwiki/CCHR/.
123. Lötzbeyer, H. and Pretschner, A. 2000. AutoFocus on constraint logic programming. In LPSE '00: Proc. Intl. Workshop on (Constraint) Logic Programming and Software Engineering.
124. Maher, M. J. 2002. Propagation completeness of reactive constraints. In Stuckey (2002), 148-162.
125. Meister, M. 2006. Fine-grained parallel implementation of the preflow-push algorithm in CHR. In Fink et al. (2006), 172-181.
126. Meister, M., Djelloul, K. and Frühwirth, T. 2006. Complexity of a CHR solver for existentially quantified conjunctions of equations over trees. In CSCLP '06: Proc. 11th Annual ERCIM Workshop on Constraint Solving and Constraint Programming, F. Azevedo, P. Barahona, F. Fages, and F. Rossi, Eds. LNCS, vol.4651. Springer, 139-153.
127. Meister, M., Djelloul, K. and Robin, J. 2007. A unified semantics for constraint handling rules in transaction logic. In LPNMR '07: Proc. 9th Intl. Conf. Logic Programming and Nonmonotonic Reasoning, C. Baral, G. Brewka and J. S. Schlipf, Eds. LNCS, vol.4483. Springer, 201-213.
128. V execution engine. In Schrijvers and Frühwirth (2005b), 35-45.
129. Meyer, B. 2000. A constraint-based framework for diagrammatic reasoning. In Holzbaur and Frühwirth (2000b), 327-344.
130. Morawietz, F. 2000. Chart parsing and constraint programming. In COLING '00: Proc. 18th Intl. Conf. on Computational Linguistics, M. Kay, Ed. Morgan Kaufmann.
131. Morawietz, F. and Blache, P. 2002. Parsing natural languages with CHR. Unpublished Draft [online]. URL: http://www.kuleuven.be/cwis/email disclaimer.htm
132. Penn, G. 2000. Applying Constraint Handling Rules to HPSG. In Frühwirth et al. (2000).
133. Pilozzi, P., Schrijvers, T. and De Schreye, D. 2007. Proving termination of CHR in Prolog: A transformational approach. In WST '07: 9th Intl. Workshop on Termination.
134. Pretschner, A., Slotosch, O., Aiglstorfer, E. and Kriebel, S. 2004. Model-based testing for real. J. Software Tools for Technology Transfer (STTT) 5, 2-3, 140-157.
135. Raiser, F. 2007. Graph transformation systems in CHR. In Dahl and Niemelä (2007), 240-254.
136. Raiser, F. and Tacchella, P. 2007. On confluence of non-terminating CHR programs. In Djelloul et al. (2007), 63-76.
137. Ribeiro, C., Zú quete, A., Ferreira, P. and Guedes, P. 2000. Security policy consistency. In Frühwirth et al. (2000).
138. Ringwelski, G. and Schlenker, H. 2000a. Type inference in CHR programs for the composition of constraint systems. In WLP '00: Proc. 15th Workshop on Logic Programming, S. Abdennadher, U. Geske and D. Seipel, Eds. 137-146.
139. Ringwelski, G. and Schlenker, H. 2000b. Using typed interfaces to compose CHR programs. In RCoRP '00(bis): Proc. 2nd Workshop on Rule-Based Constraint Reasoning and Programming, T. Frühwirth, Eds.
140. Robin, J. and Vitorino, J. 2006. ORCAS: Towards a CHR-based model-driven framework of reusable reasoning components. In Fink et al. (2006), 192-199.
141. Robin, J., Vitorino, J. and Wolf, A. 2007. Constraint programming architectures: Review and a new proposal. Journal of Universal Computer System 13, 6, 701-720.
142. Sarna-Starosta, B. and Ramakrishnan, C. 2007. Compiling Constraint Handling Rules for efficient tabled evaluation. In PADL '07: Proc. 9th Intl. Symp. Practical Aspects of Declarative Languages, M. Hanus, Ed. LNCS, vol.4354. Springer, 170-184. System's homepage at URL: http://www.cse.msu.edu/∼bss/chr d.
143. Sarna-Starosta, B. and Schrijvers, T. 2007. Indexing Techniques for CHR Based on Program Transformation. Tech. Rep. CW 500, K.U.Leuven, Dept. Comp. Sc. Aug.
144. Schiffel, S. and Thielscher, M. 2007. Fluxplayer: A successful general game player. In AAAI '07: Proc. 22nd AAAI Conf. Artificial Intelligence. AAAI Press, 1191-1196.
145. Schmauß, M. 1999. An implementation of CHR in Java. Diplomarbeit. Institute of Computer Science, LMU, Munich, Germany.
146. Schrijvers, T. 2004. JmmSolve: A generative Java memory model implemented in Prolog and CHR. In Demoen and Lifschitz (2004), 475-476.
147. Schrijvers, T. 2005. Analyses, Optimizations and Extensions of Constraint Handling Rules. Ph.D. Thesis, K.U.Leuven, Leuven, Belgium.
148. Schrijvers, T. and Bruynooghe, M. 2006. Polymorphic algebraic data type reconstruction. In PPDP '06, A. Bossi and M. Maher, Eds. ACM Press, 85-96.
149. Schrijvers, T. and Demoen, B. 2004a. Antimonotony-based delay avoidance for CHR. Tech. Rep. CW 385, K.U.Leuven, Dept. Comp. Sc. July.
150. Schrijvers, T. and Demoen, B. 2004b. The K.U.Leuven CHR system: Implementation and application. In Frühwirth and Meister (2004), 8-12. System's homepage at URL: http://www.cs.kuleuven.be/∼toms/CHR/.
151. Schrijvers, T., Demoen, B., Duck, G. J., Stuckey, P. J. and Frühwirth, T. 2006a. Automatic implication checking for CHR constraints. In RULE '05: 6th Intl. Workshop on Rule-Based Programming, H. Cirstea and N. Martí-Oliet, Eds. ENTCS, vol.147(1). Elsevier, 93-111.
152. Schrijvers, T. and Frühwirth, T. 2005a. Analysing the CHR implementation of union-find. In Wolf et al. (2005), 135-146.
153. Schrijvers, T. and Frühwirth, T., Eds. 2005b. CHR '05: Proc. 2nd Workshop on Constraint Handling Rules. K.U.Leuven, Dept. Comp. Sc., Technical report CW 421.
154. Schrijvers, T. and Frühwirth, T., Eds. 2006. CHR '06: Proc. 3rd Workshop on Constraint Handling Rules. K.U.Leuven, Dept. Comp. Sc., Technical report CW 452.
155. Schrijvers, T. and Frühwirth, T. 2006. Optimal union-find in Constraint Handling Rules. Journal on Theory and Practice of Logic Programming 6, 1-2, 213-224. (Pubitemid 43170525)
156. Schrijvers, T., Stuckey, P. J. and Duck, G. J. 2005a. Abstract interpretation for constraint handling rules. In PPDP '05, P. Barahona and A. Felty, Eds. ACM Press, 218-229.
157. Schrijvers, T. and Warren, D. S. 2004. Constraint Handling Rules and tabled execution. In Demoen and Lifschitz (2004), 120-136.
158. Schrijvers, T., Warren, D. S. and Demoen, B. 2003. CHR for XSB. In CICLOPS '03: Proc. 3rd Intl. Colloq. on Implementation of Constraint and Logic Programming Systems, R. Lopes and M. Ferreira, Eds. University of Porto, Portugal, Dept. Comp. Sc., Technical report DCC-2003-05. 7-20.
159. Schrijvers, T., Wielemaker, J. and Demoen, B. 2005b. Poster: Constraint Handling Rules for SWI-Prolog. In Wolf et al. (2005).
160. Schrijvers, T., Zhou, N.-F. and Demoen, B. 2006b. Translating Constraint Handling Rules into Action Rules. In Schrijvers and Frühwirth (2006), 141-155.
161. Schumann, E. T. 2002. A literate programming system for logic programs with constraints. In WFLP '02: Proc. 11th Intl. Workshop on Functional and (Constraint) Logic Programming, M. Comini and M. Falaschi, Eds. University of Udine, Research Report UDMI/18/2002/RR.
162. Scientific Software & Systems Ltd. 2008. Company Profile: Solving problems with proven solutions. Available at URL: http://www.sss.co.nz/.
163. Seitz, C., Bauer, B. and Berger, M. 2002. Planning and scheduling in multi agent systems using Constraint Handling Rules. In IC-AI '02: Proc. Intl. Conf. Artificial Intelligence, H. Arabnia and Y. Mun, Eds. vol.1. CSREA Press, 295-301.
164. Shigeta, Y., Akama, K., Mabuchi, H. and Koike, H. 2006. Converting Constraint Handling Rules to equivalent transformation rules. Journal of Advanced Computational Intelligence and Intelligent Informatics 10, 3, 339-348.
165. Simöes, H. and Florido, M. 2004. TypeTool: A type inference visualization tool. In WFLP '04: Proc. 13th Intl. Workshop on Functional and (Constraint) Logic Programming, H. Kuchen, Ed. RWTH Aachen, Dept. Comp. Sc., Technical report AIB-2004-05. 48-61.
166. Sneyers, J., Schrijvers, T. and Demoen, B. 2005. Guard and continuation optimization for occurrence representations of CHR. In Gabbrielli and Gupta (2005), 83-97.
167. Sneyers, J., Schrijvers, T. and Demoen, B. 2006a. Dijkstra's algorithm with Fibonacci heaps: An executable description in CHR. In Fink et al. (2006), 182-191.
168. Sneyers, J., Schrijvers, T. and Demoen, B. 2006b. Memory reuse for CHR. In Etalle and Truszczynski (2006), 72-86.
169. Sneyers, J., Schrijvers, T. and Demoen, B. 2009. The computational power and complexity of Constraint Handling Rules. ACM Transactions on Programming Languages and Systems 31, 2.
170. Sneyers, J., Van Weert, P. and Schrijvers, T. 2007. Aggregates for Constraint Handling Rules. In Djelloul et al. (2007), 91-105.
171. Stuckey, P. J., Ed. 2002. ICLP '02: Proc. 18th Intl. Conf. Logic Programming. LNCS, vol.2401. Springer.
172. Stuckey, P. J. and Sulzmann, M. 2005. A theory of overloading. ACM Transactions on Programming Languages and Systems 27, 6, 1216-1269.
173. Sulzmann, M., Duck, G. J., Peyton-Jones, S. and Stuckey, P. J. 2007. Understanding functional dependencies via Constraint Handling Rules. Journal of Functional Programming 17, 1, 83-129.
174. Sulzmann, M. and Lam, E. S. 2007a. Compiling Constraint Handling Rules with lazy and concurrent search techniques. In Djelloul et al. (2007), 139-149.
175. Sulzmann, M. and Lam, E. S. 2007b. Haskell -join -rules. In IFL '07: 19th Intl. Symp. Implementation and Application of Functional Languages, O. Chitil, Ed. 195-210, Technical report No. 12-107, Computing Laboratory, University of Kent, UK.
176. Sulzmann, M., Schrijvers, T. and Stuckey, P. J. 2006. Principal type inference for GHCstyle multi-parameter type classes. In APLAS '06: Proc. 4th Asian Symp. on Programming Languages and Systems, N. Kobayashi, Ed. LNCS, vol.4279. Springer, 26-43.
177. Sulzmann, M., Wazny, J. and Stuckey, P. J. 2005. Constraint abduction and constraint handling rules. In Schrijvers and Frühwirth (2005b), 63-78.
178. Tacchella, P., Gabbrielli, M. and Meo, M. C. 2007. Unfolding in CHR. In PPDP '07, M. Leuschel and A. Podelski, Eds. ACM Press, 179-186.
179. Thielscher, M. 2002. Reasoning about actions with CHRs and finite domain constraints. In Stuckey (2002), 70-84.
180. Thielscher, M. 2005. FLUX: A logic programming method for reasoning agents. In Abdennadher et al. (2005), 533-565.
181. Ueda, K. et al. 2006. LMNtal as a unifying declarative language. In Schrijvers and Frühwirth (2006), 1-15. Invited talk.
182. Van Weert, P. 2008. Compiling Constraint Handling Rules to Java: A reconstruction. Tech. Rep. CW 521, K.U.Leuven, Dept. Comp. Sc. Aug.
183. Van Weert, P., Schrijvers, T. and Demoen, B. 2005. K.U.Leuven JCHR: A user-friendly, flexible and efficient CHR system for Java. In Schrijvers and Frühwirth (2005b), 47-62. System's homepage at URL: http://www.cs.kuleuven. be/∼petervw/JCHR/.
184. Van Weert, P., Sneyers, J. and Demoen, B. 2008a. Aggregates for CHR through program transformation. In LOPSTR '07, Revised Selected Papers, A. King, Ed. LNCS, vol.4915.
185. Van Weert, P., Sneyers, J., Schrijvers, T. and Demoen, B. 2006. Extending CHR with negation as absence. In Schrijvers and Frühwirth (2006), 125-140.
186. Van Weert, P., Wuille, P., Schrijvers, T. and Demoen, B. 2008b. CHR for imperative host languages. In Special Issue on Constraint Handling Rules. LNAI, vol.5388. Springer.
187. Voets, D., Pilozzi, P. and De Schreye, D. 2007. A new approach to termination analysis of Constraint Handling Rules. In Djelloul et al. (2007),
188. Voll, K. 2006. A methodology of error detection: Improving speech recognition in radiology. Ph.D. thesis, Simon Fraser University, Canada.
189. Wazny, J. 2006. Type inference and type error diagnosis for Hindley/Milner with extensions. Ph.D. Thesis, University of Melbourne, Australia.
190. Wolf, A. 1999. Adaptive Constraintverarbeitung mit Constraint-Handling- Rules -ein allgemeiner Ansatz zur Lösung dynamischer Constraint-probleme. Ph.D. Thesis, Technical University Berlin, Berlin, Germany.
191. Wolf, A. 2000a. Projection in adaptive constraint handling. In New Trends in Constraints, Joint ERCIM/Compulog Net Workshop, October 1999, Selected papers, K. Apt, A. Kakas, E. Monfroy and F. Rossi, Eds. LNCS, vol.1865. Springer, 318-338.
192. Wolf, A. 2000b. Toward a rule-based solution of dynamic constraint hierarchies over finite domains. In Frühwirth et al. (2000).
193. Wolf, A. 2001a. Adaptive constraint handling with CHR in Java. In CP '01, T. Walsh, Ed. LNCS, vol.2239. Springer, 256-270.
194. Wolf, A. 2001b. Attributed variables for dynamic constraint solving. In Proc. 14th Intl. Conf. Applications of Prolog. Prolog Association of Japan, 211-219.
195. Wolf, A. 2005. Intelligent search strategies based on adaptive Constraint Handling Rules. In Abdennadher et al. (2005), 567-594.
196. Wolf, A., Frühwirth, T. and Meister, M., Eds. 2005. W(C)LP '05: Proc. 19th Workshop on (Constraint) Logic Programming. Ulmer Informatik-Berichte, vol.2005-01. Universität Ulm, Germany.
197. Wolf, A., Gruenhagen, T. and Geske, U. 2000. On incremental adaptation of CHR derivations. In Holzbaur and Frühwirth (2000b), 389-416.
198. V based on justifications. In Djelloul et al. (2007), 1-15.
199. Wuille, P., Schrijvers, T. and Demoen, B. 2007. CCHR: The fastest CHR implementation, in C. In Djelloul et al. (2007), 123-137. System's homepage at URL: http://www.cs.kuleuven.be/∼pieterw/CCHR/.