Skip to main content
    • Aa
    • Aa
  • Get access
    Check if you have access via personal or institutional login
  • Cited by 8
  • Cited by
    This article has been cited by the following publications. This list is generated based on data provided by CrossRef.

    Chen, Ruoyu Liao, Lejian and Fang, Zhi 2012. 2012 IEEE Eighth World Congress on Services. p. 211.

    DUCK, GREGORY J. 2012. SMCHR: Satisfiability modulo constraint handling rules. Theory and Practice of Logic Programming, Vol. 12, Issue. 4-5, p. 601.

    Ueda, Kazunori and Ogawa, Seiji 2012. HyperLMNtal: An Extension of a Hierarchical Graph Rewriting Model. KI - Künstliche Intelligenz, Vol. 26, Issue. 1, p. 27.

    LAM, EDMUND S. L. and SULZMANN, MARTIN 2011. Concurrent goal-based execution of Constraint Handling Rules. Theory and Practice of Logic Programming, Vol. 11, Issue. 06, p. 841.

    BETZ, HARIOLF RAISER, FRANK and FRÜHWIRTH, THOM 2010. A complete and terminating execution model for Constraint Handling Rules. Theory and Practice of Logic Programming, Vol. 10, Issue. 4-6, p. 597.

    GABBRIELLI, MAURIZIO MAURO, JACOPO MEO, MARIA CHIARA and SNEYERS, JON 2010. Decidability properties for fragments of CHR. Theory and Practice of Logic Programming, Vol. 10, Issue. 4-6, p. 611.

    SNEYERS, JON MEERT, WANNES VENNEKENS, JOOST KAMEYA, YOSHITAKA and SATO, TAISUKE 2010. CHR(PRISM)-based probabilistic logic learning. Theory and Practice of Logic Programming, Vol. 10, Issue. 4-6, p. 433.

    Van Weert, Peter 2010. Efficient Lazy Evaluation of Rule-Based Programs. IEEE Transactions on Knowledge and Data Engineering, Vol. 22, Issue. 11, p. 1521.

  • Theory and Practice of Logic Programming, Volume 10, Issue 1
  • January 2010, pp. 1-47

As time goes by: Constraint Handling Rules: A survey of CHR research from 1998 to 2007

  • DOI:
  • Published online: 22 December 2009

Constraint Handling Rules (CHR) is a high-level programming language based on multiheaded multiset rewrite rules. Originally designed for writing user-defined constraint solvers, it is now recognized as an elegant general purpose language. Constraint Handling Rules related research has surged during the decade following the previous survey by Frühwirth (J. Logic Programming, Special Issue on Constraint Logic Programming, 1998, vol. 37, nos. 1–3, pp. 95–138). Covering more than 180 publications, this new survey provides an overview of recent results in a wide range of research areas, from semantics and analysis to systems, extensions, and applications.

Linked references
Hide All

This list contains references from the content that can be linked to their source. For a full set of references and notes please see the PDF or HTML where available.

S. Abdennadher , T. Frühwirth and H. Meuss 1999. Confluence and semantics of constraint simplification rules. Constraints 4, 2, 133165.

S. Abdennadher and C. Rigotti 2004. Automatic generation of rule-based constraint solvers over finite domains. ACM TOCL 5, 2, 177205.

M. Alberti , D. Daolio , P. Torroni , M. Gavanelli , E. Lamma and P. Mello 2004. Specification and verification of agent interaction protocols in a logic-based system. In SAC '04: Proc. 19th ACM Symp. Applied Computing, H. Haddad , Eds. ACM Press, 7278.

M. Alberti , M. Gavanelli , E. Lamma , F. Chesani , P. Mello and P. Torroni 2006. Compliance verification of agent interaction: A logic-based software tool. Applied Artificial Intelligence 20, 2–4, 133157.

S. Bistarelli , T. Frühwirth , M. Marte and F. Rossi 2004. Soft constraint propagation and solving in Constraint Handling Rules. Computational Intelligence: Special Issue on Preferences in AI and CP 20, 2 (May), 287307.

W.-N. Chin , F. Craciun , S.-C. Khoo and C. Popeea 2006. A flow-based approach for variant parametric types. SIGPLAN Not. 41, 10, 273290.

H. Christiansen and V. Dahl 2003. Logic grammars for diagnosis and repair. International Journal of Artificial Intelligence Tools 12, 3, 227248.

L. De Koninck , T. Schrijvers and B. Demoen 2007b. User-definable rule priorities for CHR. In PPDP '07, M. Leuschel and A. Podelski , Eds. ACM Press, 2536.

L. De Koninck , P. J. Stuckey and G. J. Duck 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, 3247.

G. Delzanno , M. Gabbrielli and M. C. Meo 2005. A compositional semantics for CHR. In PPDP '05, P. Barahona and A. Felty , Eds. ACM Press, 209217.

K. Djelloul , T.-B.-H. Dao and T. Frühwirth 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, 5864.

M. Ducassé 1999. Opium: an extendable trace analyzer for Prolog. J. Logic Programming 39, 1–3, 177223.

G. J. Duck , P. J. Stuckey , M. García de la Banda and C. Holzbaur 2003. Extending arbitrary solvers with Constraint Handling Rules. In PPDP '03. ACM Press, 7990.

M. T. Escrig and F. Toledo 1998a. A framework based on CLP extended with CHRs for reasoning with qualitative orientation and positional information. J. Visual Languages and Computing 9, 1, 81101.

T. Frühwirth 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.

T. Frühwirth and S. Abdennadher 2003. Essentials of Constraint Programming. Springer.

T. Frühwirth and P. Brisset 2000. Placing base stations in wireless indoor communication networks. IEEE Intelligent Systems and Their Applications 15, 1, 4953.

M. Gabbrielli and M. C. Meo 2009. A compositional semantics for CHR. ACM Transactions on Computational Logic 10, 2.

D. Garat and D. Wonsever 2002. A constraint parser for contextual rules. In Proc. 22nd Intl. Conf. of the Chilean Computer Science Society. IEEE Computer Society, 234242.

C. Holzbaur and T. Frühwirth 2000a. A Prolog Constraint Handling Rules compiler and runtime system. Journal of Applied Artificial Intelligence 14 (4), 369388.

N. Kosmatov 2006a. A constraint solver for sequences and its applications. In Proc. 2006 ACM Symp. on Applied Computing. ACM Press, 404408.

E. S. Lam and M. Sulzmann 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:

A. Pretschner , O. Slotosch , E. Aiglstorfer and S. Kriebel 2004. Model-based testing for real. J. Software Tools for Technology Transfer (STTT) 5, 2–3, 140157.

T. Schrijvers and M. Bruynooghe 2006. Polymorphic algebraic data type reconstruction. In PPDP '06, A. Bossi and M. Maher , Eds. ACM Press, 8596.

T. Schrijvers , P. J. Stuckey and G. J. Duck 2005a. Abstract interpretation for constraint handling rules. In PPDP '05, P. Barahona and A. Felty , Eds. ACM Press, 218229.

J. Sneyers , T. Schrijvers and B. Demoen 2009. The computational power and complexity of Constraint Handling Rules. ACM Transactions on Programming Languages and Systems 31, 2.

P. J. Stuckey , Ed. 2002. ICLP '02: Proc. 18th Intl. Conf. Logic Programming. LNCS, vol. 2401. Springer.

P. J. Stuckey and M. Sulzmann 2005. A theory of overloading. ACM Transactions on Programming Languages and Systems 27, 6, 12161269.

P. Tacchella , M. Gabbrielli and M. C. Meo 2007. Unfolding in CHR. In PPDP '07, M. Leuschel and A. Podelski , Eds. ACM Press, 179186.

P. Van Weert 2008. Compiling Constraint Handling Rules to Java: A reconstruction. Tech. Rep. CW 521, K.U.Leuven, Dept. Comp. Sc. Aug.

Recommend this journal

Email your librarian or administrator to recommend adding this journal to your organisation's collection.

Theory and Practice of Logic Programming
  • ISSN: 1471-0684
  • EISSN: 1475-3081
  • URL: /core/journals/theory-and-practice-of-logic-programming
Please enter your name
Please enter a valid email address
Who would you like to send this to? *