Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Projection in Adaptive Constraint Handling
Selected papers from the Joint ERCIM/Compulog Net Workshop on New Trends in Contraints
Selected Papers from Constraint Programming: Basics and Trends
Adaptive Constraint Handling with CHR in Java
CP '01 Proceedings of the 7th International Conference on Principles and Practice of Constraint Programming
CHRv: A Flexible Query Language
FQAS '98 Proceedings of the Third International Conference on Flexible Query Answering Systems
Intelligent search strategies based on adaptive Constraint Handling Rules
Theory and Practice of Logic Programming
Optimal union-find in Constraint Handling Rules
Theory and Practice of Logic Programming
A Flexible Search Framework for CHR
Constraint Handling Rules
Journal of Artificial Intelligence Research
A Flexible Search Framework for CHR
Constraint Handling Rules
Smchr: Satisfiability modulo constraint handling rules
Theory and Practice of Logic Programming
| Hi-index | 0.00 |
Adaptive constraint processing with Constraint Handling Rules (CHR) allows the application of intelligent search strategies to solve Constraint Satisfaction Problems (CSP), but these search algorithms have to be implemented in the host language of adaptive CHR which is currently Java. On the other hand, CHR *** enables to explicitly formulate search in CHR, using disjunctive bodies to model choices. However, a naive implementation for handling disjunctions, in particular chronological backtracking (as implemented in Prolog), might cause "thrashing" due to an inappropriate order of decisions. In order to avoid this, a first combination of adaptive CHR and CHR *** is presented to offer a more efficient embedded search mechanism to handle disjunctions. Therefore, the refined operational semantics of CHR is extended for disjunctions and adaptation.