A Flexible Search Framework for CHR

Authors:
Leslie Koninck;Tom Schrijvers;Bart Demoen
Affiliations:
Department of Computer Science, K.U.Leuven, Belgium;Department of Computer Science, K.U.Leuven, Belgium;Department of Computer Science, K.U.Leuven, Belgium
Venue:
Constraint Handling Rules
Year:
2009

Citing 17
Cited 2

Depth-first iterative-deepening: an optimal admissible tree search

Artificial Intelligence
Iterative broadening

Artificial Intelligence
Comparing trailing and copying for constraint programming

Proceedings of the 1999 international conference on Logic programming
Search and strategies in OPL

ACM Transactions on Computational Logic (TOCL)
Encapsulated Search and Constraint Programming in Oz

PPCP '94 Proceedings of the Second International Workshop on Principles and Practice of Constraint Programming
An Open-Ended Finite Domain Constraint Solver

PLILP '97 Proceedings of the9th International Symposium on Programming Languages: Implementations, Logics, and Programs: Including a Special Trach on Declarative Programming Languages in Education
Controlling Search in Declarative Programs

PLILP '98/ALP '98 Proceedings of the 10th International Symposium on Principles of Declarative Programming
CHRv: A Flexible Query Language

FQAS '98 Proceedings of the Third International Conference on Flexible Query Answering Systems
Enhancing a search algorithm to perform intelligent backtracking

Theory and Practice of Logic Programming
Intelligent search strategies based on adaptive Constraint Handling Rules

Theory and Practice of Logic Programming
User-definable rule priorities for CHR

Proceedings of the 9th ACM SIGPLAN international conference on Principles and practice of declarative programming
Adaptive CHR Meets CHR V

Constraint Handling Rules
Dynamic backtracking

Journal of Artificial Intelligence Research
Depth-bounded discrepancy search

IJCAI'97 Proceedings of the Fifteenth international joint conference on Artifical intelligence - Volume 2
Conflict-directed backjumping revisited

Journal of Artificial Intelligence Research
Limited discrepancy search

IJCAI'95 Proceedings of the 14th international joint conference on Artificial intelligence - Volume 1
Value ordering for finding all solutions

IJCAI'05 Proceedings of the 19th international joint conference on Artificial intelligence

Adaptive CHR Meets CHR V

Constraint Handling Rules
On the portability of prolog applications

PADL'11 Proceedings of the 13th international conference on Practical aspects of declarative languages

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper introduces a framework for the specification of tree search strategies in CHR with disjunction (CHR *** ). 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 (CHRrp) 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.