Open AccessA Flexible Search Framework for CHR
Author(s) -
Leslie De Koninck,
Tom Schrijvers,
Bart Demoen
Publication year - 2008
Publication title -
lecture notes in computer science
Language(s) - English
Resource type - Book series
SCImago Journal Rank - 0.249
H-Index - 400
eISSN - 1611-3349
pISSN - 0302-9743
DOI - 10.1007/978-3-540-92243-8_2
Subject(s) - computer science , depth first search , search tree , extension (predicate logic) , branch and bound , tree (set theory) , breadth first search , search algorithm , theoretical computer science , algorithm , programming language , mathematics , combinatorics
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.
Accelerating Research
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom
Address
John Eccles HouseRobert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom