The Constraint Handling Rules (CHR) language is a declarative concurrent committed-choice constraint logic programming language consisting of guarded rules that transform multisets of relations called constraints until no more change occurs.
The CHR language saw the light more than 15 years ago. Since then, it has become a major declarative specification and implementation language for constraint-based algorithms and applications. In recent years, five workshops on constraint handling rules have spurred the exchange of ideas within the CHR community, which has led to increased international collaboration, new theoretical results and optimized implementations.
The aim of this volume was to attract high-quality research papers on these recent advances in Constraint Handling Rules. The 7 papers presented together with an introductory paper on CHR cover topics on search, applications, theory, and implementation of CHR.
Author(s): Thom Frühwirth (auth.), Tom Schrijvers, Thom Frühwirth (eds.)
Series: Lecture Notes in Computer Science 5388 : Lecture Notes in Artificial Intelligence
Edition: 1
Publisher: Springer-Verlag Berlin Heidelberg
Year: 2008
Language: English
Pages: 245
City: New York
Tags: Artificial Intelligence (incl. Robotics); Mathematical Logic and Formal Languages; Programming Techniques; Algorithm Analysis and Problem Complexity; Database Management
Front Matter....Pages -
Welcome to Constraint Handling Rules....Pages 1-15
A Flexible Search Framework for CHR....Pages 16-47
Adaptive CHR Meets CHR ∨ ....Pages 48-69
Constructing Rule-Based Solvers for Intentionally-Defined Constraints....Pages 70-84
Implementing Probabilistic Abductive Logic Programming with Constraint Handling Rules....Pages 85-118
A Compositional Semantics for CHR with Propagation Rules....Pages 119-160
CHR for Imperative Host Languages....Pages 161-212
Guard Reasoning in the Refined Operational Semantics of CHR....Pages 213-244
Back Matter....Pages -
