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
  • 2008-01-01T00:00:00+01:00 (literal)
Http://www.cnr.it/ontology/cnr/pubblicazioni.owl#doi
  • 10.1080/09528130802667690 (literal)
Alternative label
  • [1] Bistarelli S.,Codognet P., Hui H.K.C., Lee J.H.M. (2008)
    Solving Finite Domain Constraint Hierarchies by Local Consistency and Tree
    in Journal of experimental and theoretical artificial intelligence (Print); TAYLOR & FRANCIS LTD, London (Regno Unito)
    (literal)
Http://www.cnr.it/ontology/cnr/pubblicazioni.owl#autori
  • [1] Bistarelli S.,Codognet P., Hui H.K.C., Lee J.H.M. (literal)
Pagina inizio
  • 233 (literal)
Pagina fine
  • 257 (literal)
Http://www.cnr.it/ontology/cnr/pubblicazioni.owl#altreInformazioni
  • http://www.sci.unich.it/~bista/papers/papers-download/moroccojournal07revised.pdf (literal)
Http://www.cnr.it/ontology/cnr/pubblicazioni.owl#numeroVolume
  • 21 (literal)
Rivista
Http://www.cnr.it/ontology/cnr/pubblicazioni.owl#note
  • to be published (literal)
Http://www.cnr.it/ontology/cnr/pubblicazioni.owl#numeroFascicolo
  • 4 (literal)
Http://www.cnr.it/ontology/cnr/pubblicazioni.owl#affiliazioni
  • [1] CNR-IIT, Pisa, Italy; [2] Department of Computer Science University of Paris 6, France; [3] Department of Computer Science and Engineering, The Chinese University of Hong Kong, China (literal)
Titolo
  • Solving Finite Domain Constraint Hierarchies by Local Consistency and Tree (literal)
Abstract
  • We provide a reformulation of the constraint hierarchies (CHs) framework based on the notion of error indicators. Adapting the generalised view of local consistency in semiring-based constraint satisfaction problems, 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 domain (FD) CH solver. Experimentation confirms the efficiency and robustness of our proposed solver prototype. Unlike other FD CH solvers, our proposed method works for both local and global comparators. In addition, our solver can support arbitrary error functions. (literal)
  • constraint hierarchies, Algorithm (literal)
Editore
Prodotto di
Autore CNR
Insieme di parole chiave

Incoming links:


Prodotto
Autore CNR di
Http://www.cnr.it/ontology/cnr/pubblicazioni.owl#rivistaDi
Editore di
Insieme di parole chiave di
data.CNR.it