http://www.cnr.it/ontology/cnr/individuo/prodotto/ID30015

Solving Finite Domain Constraint Hierarchies by Local Consistency and Tree (Articolo in rivista)

Type

Label

Solving Finite Domain Constraint Hierarchies by Local Consistency and Tree (Articolo in rivista) (literal)

Anno

Alternative label

Bistarelli S.; Codognet P.; Lee J. H. M.; Hui H. (2009)
Solving Finite Domain Constraint Hierarchies by Local Consistency and Tree
(literal)

Http://www.cnr.it/ontology/cnr/pubblicazioni.owl#autori

Pagina inizio

Pagina fine

Http://www.cnr.it/ontology/cnr/pubblicazioni.owl#numeroVolume

Http://www.cnr.it/ontology/cnr/pubblicazioni.owl#note

In: Journal of Experimental & Theoretical Artificial Intelligence, vol. 21 (4) pp. 233 - 257. Taylor & Francis Group, 2009. (literal)

Note

Http://www.cnr.it/ontology/cnr/pubblicazioni.owl#affiliazioni

CNR-IIT, Pisa, University Pierre et Marie Curie (Paris 6), Department of Computer Science and Engineering, The Chinese University of Hong Kong, Hong Kong SAR, China (literal)

Titolo

Solving Finite Domain Constraint Hierarchies by Local Consistency and Tree (literal)

Abstract

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. (literal)

Prodotto di

Autore CNR

Prodotto

Autore CNR di

data.CNR.it