In this paper, we compare definitions of n-ary consistency introduced by Dechter &; van Beek [1] and Jegou [2]. We show the duality between relational-^-consisten-cy and hyper-^-consistency. The algorithm CBT: Constraint-based BackTrack-ing, results from this comparison study. It is a dual approach with respect to the standard backtrack algorithm (variable-based BT).
展开▼
