# zbMATH — the first resource for mathematics

A flexible search framework for CHR. (English) Zbl 1229.68018
Schrijvers, Tom (ed.) et al., Constraint Handling Rules. Current research topics. Berlin: Springer (ISBN 978-3-540-92242-1/pbk). Lecture Notes in Computer Science 5388. Lecture Notes in Artificial Intelligence, 16-47 (2008).
Summary: This paper introduces a framework for the specification of tree search strategies in CHR with disjunction (CHR$$^{ \vee })$$. We support the specification of common search strategies such as depth-first, breadth-first and best-first, as well as constrained optimization by means of branch & bound search. The framework is given as an extension of CHR with rule priorities (CHR$$^{\text{rp}})$$ in which each branch of the search tree is assigned a branch priority. This approach leads to a uniform solution to execution control in CHR.
For the entire collection see [Zbl 1157.68008].

##### MSC:
 68N17 Logic programming
Mercury; OPL
Full Text: