Arc and path consistence revisited
Artificial Intelligence
Arc-consistency and arc-consistency again
Artificial Intelligence
Acceleration methods of numeric CSPc
AAAI '98/IAAI '98 Proceedings of the fifteenth national/tenth conference on Artificial intelligence/Innovative applications of artificial intelligence
Generalizing partial order and dynamic backtracking
AAAI '98/IAAI '98 Proceedings of the fifteenth national/tenth conference on Artificial intelligence/Innovative applications of artificial intelligence
Refining the basic constraint propagation algorithm
IJCAI'01 Proceedings of the 17th international joint conference on Artificial intelligence - Volume 1
Making AC-3 an optimal algorithm
IJCAI'01 Proceedings of the 17th international joint conference on Artificial intelligence - Volume 1
Constraint-Level Advice for Shaving
ICLP '08 Proceedings of the 24th International Conference on Logic Programming
Proceedings of the 2006 conference on ECAI 2006: 17th European Conference on Artificial Intelligence August 29 -- September 1, 2006, Riva del Garda, Italy
Reasoning from last conflict(s) in constraint programming
Artificial Intelligence
Constructive interval disjunction
CP'07 Proceedings of the 13th international conference on Principles and practice of constraint programming
A framework for decision-based consistencies
CP'11 Proceedings of the 17th international conference on Principles and practice of constraint programming
| Hi-index | 0.00 |
Arc-consistency plays such a key role in constraint programming for solving real life problems that it is almost the only algorithm used for reducing domains. There are a few specific problems for which a stronger form of propagation, often called shaving, is more efficient. Nevertheless, in many cases. shaving at each node of the search tree is not worth doing: arc-consistency filtering is much faster, and the additional domain reductions inferred by shaving do not pay off. In this paper, we propose a new kind of shaving called QuickShaving, which is guided by the search. As QuickShaving may infer some additional domain reductions compared with arc-consistency, it can improve the search for a solution by an exponential ratio. Moreover, the advantage of Quick Shaving is that in practice, unlike a standard form of shaving, the additional domain reductions deduced by QuickShaving come at a very low overhead compared with arc-consistency.