Author:
SNEYERS JON,VAN WEERT PETER,SCHRIJVERS TOM,DE KONINCK LESLIE
Abstract
AbstractConstraint 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.
Publisher
Cambridge University Press (CUP)
Subject
Artificial Intelligence,Computational Theory and Mathematics,Hardware and Architecture,Theoretical Computer Science,Software
Reference199 articles.
1. 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/.
2. Frühwirth T. 2005b. Parallelizing union-find in Constraint Handling Rules using confluence. In Gabbrielli and Gupta (2005), 113–127.
3. Essentials of Constraint Programming
4. Semantic Web Reasoning for Ontology-Based Integration of Resources
Cited by
28 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献