PUMA
Istituto di Informatica e Telematica     
Bistarelli S., Codognet P., Lee J. H. M., Hui H. Solving Finite Domain Constraint Hierarchies by Local Consistency and Tree. In: Journal of Experimental & Theoretical Artificial Intelligence, vol. 21 (4) pp. 233 - 257. Taylor & Francis Group, 2009.
 
 
Abstract
(English)
We provide a reformulation of the constraint hierarchies (CHs) frame-work based on the notion of error indicators. Adapting the generalized view of local consistency in semiring-based constraint satisfaction problems (SCSPs), we define constraint hierarchy k-consistency (CH-k-C) and give a CH-2-C enforcement algorithm. We demonstrate how the CH-2-C algorithm can be seamlessly integrated into the ordinary branch-and-bound algorithm to make it a finite do- main CH solver. Experimentation confirms the efficiency and robustness of our proposed solver prototype. Unlike other finite domain CH solvers, our proposed method works for both local and global comparators. In addition, our solver can support arbitrary error functions.
URL: http://www.informaworld.com/smpp/50026823-14341300/content~db=all~content=a912718324
DOI: 10.1080/09528130802667690
Subject


Icona documento 1) Download Document PDF


Icona documento Open access Icona documento Restricted Icona documento Private

 


Per ulteriori informazioni, contattare: Librarian http://puma.isti.cnr.it

Valid HTML 4.0 Transitional