Box consistency through adaptive shaving

The canonical algorithm to enforce box consistency over a constraint relies on a dichotomic process to isolate the leftmost and rightmost solutions. We identify some weaknesses of the standard implementations of this approach and review the existing body of work to tackle them; we then present an adaptive shaving process to achieve box consistency by tightening a domain from both bounds inward. Experimental results show a significant improvement over existing approaches in terms of robustness for difficult problems. Categories and Subject Descriptors

• Type: Conference
• Year: 2010
• Where: SAC
• Authors: Alexandre Goldsztejn, Frédéric Goualard
• Keywords: Adaptive Shaving Process, Applied Computing, Box Consistency, Dichotomic Process, SAC 2010