A sufficient condition for backtrack-bounded search
Journal of the ACM (JACM)
Network-based heuristics for constraint-satisfaction problems
Artificial Intelligence
A generic arc-consistency algorithm and its specializations
Artificial Intelligence
A filtering algorithm for constraints of difference in CSPs
AAAI '94 Proceedings of the twelfth national conference on Artificial intelligence (vol. 1)
A theoretical evaluation of selected backtracking algorithms
Artificial Intelligence
On the conversion between non-binary constraint satisfaction problems
AAAI '98/IAAI '98 Proceedings of the fifteenth national/tenth conference on Artificial intelligence/Innovative applications of artificial intelligence
A Sufficient Condition for Backtrack-Free Search
Journal of the ACM (JACM)
On Forward Checking for Non-binary Constraint Satisfaction
CP '99 Proceedings of the 5th International Conference on Principles and Practice of Constraint Programming
Performance measurement and analysis of certain search algorithms.
Performance measurement and analysis of certain search algorithms.
The difference all-difference makes
IJCAI'99 Proceedings of the 16th international joint conference on Artifical intelligence - Volume 1
Neighborhood inverse consistency preprocessing
AAAI'96 Proceedings of the thirteenth national conference on Artificial intelligence - Volume 1
Generalized arc consistency for global cardinality constraint
AAAI'96 Proceedings of the thirteenth national conference on Artificial intelligence - Volume 1
Reformulation of Non-binary Constraints
Proceedings of the 5th International Symposium on Abstraction, Reformulation and Approximation
Constraint Modeling in the Context of Academic Task Assignment
CP '02 Proceedings of the 8th International Conference on Principles and Practice of Constraint Programming
| Hi-index | 0.00 |
Many constraint satisfaction problems can be naturally and efficiently modelled using non-binary constraints like the "all-different" and "global cardinality" constraints. Certain classes of these non-binary constraints are "network decomposable" as they can be represented by binary constraints on the same set of variables. We compare theoretically the levels of consistency which are achieved on non-binary constraints to those achieved on their binary decomposition. We present many new results about the level of consistency achieved by the forward checking algorithm and its various generalizations to non-binary constraints. We also compare the level of consistency achieved by arc-consistency and its generalization to non-binary constraints, and identify special cases of non-binary decomposable constraints where weaker or stronger conditions, than in the general case, hold. We also analyze the cost, in consistency checks, required to achieve certain levels of consistency.