论文信息 - An Efficient Filtering Algorithm for Disjunction of Constraints

An Efficient Filtering Algorithm for Disjunction of Constraints

Disjunctions of constraints frequently appear in applications of constraint programming. In this paper, we propose a new filtering algorithm for the disjunctions of constraints. It performs the same domain reductions as constructive disjunction [1,2], but is more efficient.

Olivier Lhomme | Olivier Lhomme

[1] Günther Görz,et al. KI-96: Advances in Artificial Intelligence , 1996, Lecture Notes in Computer Science.

[2] Jörg Würtz,et al. Constructive Disjunction Revisited , 1996, KI.

[3] Christian Bessiere,et al. Arc Consistency for General Constraint Networks: Preliminary Results , 1997, IJCAI.

[4] Christian Bessiere,et al. Arc-Consistency and Arc-Consistency Again , 1993, Artif. Intell..

[5] Thomas C. Henderson,et al. Arc and Path Consistency Revisited , 1986, Artif. Intell..

[6] Pascal Van Hentenryck,et al. Design, Implementation, and Evaluation of the Constraint Language cc(FD) , 1994, Constraint Programming.

[7] Andreas Podelski,et al. Constraint Programming: Basics and Trends , 1995, Lecture Notes in Computer Science.