Local Consistency for Ternary Numeric Constraints

We consider algorithms of the Waltz type for computing local consistency (also called arcconsistency) for constraints over numeric domains. Many commonlyused propagationrules do not in fact enforce local consistency. We extend the propagation rule given by Faltings Faltings, 1994] to the case of ternary constraints. Since any general n-ary continuous constraint can be represented as a collection of ternary ones, this also covers n-ary constraints in general. We show how the propagation can be implemented e ciently. The new algorithm gives signi cantly tighter labellings than previous propagation algorithms on most problems.

• Type: Conference
• Year: 1997
• Where: IJCAI
• Authors: Boi Faltings, Esther Gelle
• Keywords: Enforce Local Consistency, IJCAI 1997, IJCAI 2007, Local Consistency, Ternary Constraints