A Flexible Search Framework for CHR
From MaRDI portal
Publication:3616878
DOI10.1007/978-3-540-92243-8_2zbMath1229.68018OpenAlexW1593855989MaRDI QIDQ3616878
Bart Demoen, Leslie de Koninck, Tom Schrijvers
Publication date: 26 March 2009
Published in: Constraint Handling Rules (Search for Journal in Brave)
Full work available at URL: https://lirias.kuleuven.be/handle/123456789/197046
Related Items (2)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Depth-first iterative-deepening: An optimal admissible tree search
- The Correspondence Between the Logical Algorithms Language and CHR
- Adaptive CHR Meets CHR ∨
- Theory and practice of constraint handling rules
- The execution algorithm of mercury, an efficient purely declarative logic programming language
- PROGRAMMING PEARL: Enhancing a search algorithm to perform intelligent backtracking
- Logic Programming
- Intelligent search strategies based on adaptive Constraint Handling Rules
- Search and strategies in OPL
This page was built for publication: A Flexible Search Framework for CHR