Theory and Practice of Constraint Handling Rules Export

@misc{citeulike:3439082, abstract = {. Constraint Handling Rules (CHR) are our proposal to allow more flexibility and application-oriented customization of constraint systems. CHR are a declarative language extension especially designed for writing user-defined constraints. CHR are essentially a committed-choice language consisting of multi-headed guarded rules that rewrite constraints into simpler ones until they are solved. In this broad survey we aim at covering all aspects of CHR as they currently present themselves. Going from theory to practice, we will define syntax and semantics for CHR, introduce an important decidable property, confluence, of CHR programs and define a tight integration of CHR with constraint logic programming languages. This survey then describes implementations of the language before we review several constraint solvers- both traditional and non-standard ones- written in the CHR language. Finally we introduce two innovative applications that benefited from using CHR. /}, author = {Fruhwirth, Thom}, citeulike-article-id = {3439082}, citeulike-linkout-0 = {http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.10.4679}, keywords = {1998, chr, type}, posted-at = {2008-10-22 11:15:49}, priority = {2}, title = {Theory and Practice of Constraint Handling Rules}, url = {http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.10.4679}, year = {1994} }

TY - ELEC ID - citeulike:3439082 L3 - citeulike-article-id:3439082 N2 - . Constraint Handling Rules (CHR) are our proposal to allow more flexibility and application-oriented customization of constraint systems. CHR are a declarative language extension especially designed for writing user-defined constraints. CHR are essentially a committed-choice language consisting of multi-headed guarded rules that rewrite constraints into simpler ones until they are solved. In this broad survey we aim at covering all aspects of CHR as they currently present themselves. Going from theory to practice, we will define syntax and semantics for CHR, introduce an important decidable property, confluence, of CHR programs and define a tight integration of CHR with constraint logic programming languages. This survey then describes implementations of the language before we review several constraint solvers- both traditional and non-standard ones- written in the CHR language. Finally we introduce two innovative applications that benefited from using CHR. / TI - Theory and Practice of Constraint Handling Rules KW - 1998 KW - chr KW - type AU - Fruhwirth, Thom PY - 1994/// UR - http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.10.4679 ER -