Solving finite domain constraint hierarchies by local consistency and tree search

  • Authors:

  • Stefano Bistarelli;Philippe Codognet;H. K. C. Hui;J. H. M. Lee

  • Affiliations:

  • Dipartimento di Scienze, Universita "D'Annunzio" di Pescara, Italy and Istituto di Informatica e Telematica, C.N.R., Pisa, Italy;Univ. of Paris 6, Paris Cedex 05, France;Dept of Comp. Sci. & Eng., The Chinese Univ. of Hong Kong, Hong Kong;Dept of Comp. Sci. & Eng., The Chinese Univ. of Hong Kong, Hong Kong

  • Venue:
  • IJCAI'03 Proceedings of the 18th international joint conference on Artificial intelligence
  • Year:
  • 2003

Quantified Score

Hi-index 0.00

Visualization

Abstract

We provide a reformulation of the constraint hierarchies (CHs) framework 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 domain 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.