A filtering algorithm for constraints of difference in CSPs
AAAI '94 Proceedings of the twelfth national conference on Artificial intelligence (vol. 1)
A fast algorithm for the bound consistency of alldiff constraints
AAAI '98/IAAI '98 Proceedings of the fifteenth national/tenth conference on Artificial intelligence/Innovative applications of artificial intelligence
Faster Algorithms for Bound-Consistency of the Sortedness and the Alldifferent Constraint
CP '02 Proceedings of the 6th International Conference on Principles and Practice of Constraint Programming
Principles of Constraint Programming
Principles of Constraint Programming
A fast and simple algorithm for bounds consistency of the all different constraint
IJCAI'03 Proceedings of the 18th international joint conference on Artificial intelligence
Generalized arc consistency for global cardinality constraint
AAAI'96 Proceedings of the thirteenth national conference on Artificial intelligence - Volume 1
Plan b: uncertainty/time trade-offs for linear and integer programming
CPAIOR'06 Proceedings of the Third international conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
| Hi-index | 0.00 |
We propose a natural generalization of arc-consistency, which we call multiconsistency: A value v in the domain of a variable x is k-multiconsistent with respect to a constraint C if there are at least k solutions to C in which x is assigned the value v. We present algorithms that determine which variable-value pairs are k-multiconsistent with respect to several well known global constraints. In addition, we show that finding super solutions is strictly harder than finding arbitrary solutions and suggest multiconsistency as an alternative way to search for robust solutions.