×

Constructive interval disjunction. (English) Zbl 1145.68530

Bessière, Christian (ed.), Principles and practice of constraint programming – CP 2007. 13th international conference, CP 2007, Providence, RI, USA, September 23–27, 2007. Proceedings. Berlin: Springer (ISBN 978-3-540-74969-1/pbk). Lecture Notes in Computer Science 4741, 635-650 (2007).
Summary: This paper presents two new filtering operators for numerical CSPs (systems with constraints over the reals) based on constructive disjunction, as well as a new splitting heuristic. The fist operator (CID) is a generic algorithm enforcing constructive disjunction with intervals. The second one (3BCID) is a hybrid algorithm mixing constructive disjunction and shaving, another technique already used with numerical CSPs through the algorithm 3B. Finally, the splitting strategy learns from the CID filtering step the next variable to be split, with no overhead.
Experiments have been conducted with 20 benchmarks. On several benchmarks, CID and 3BCID produce a gain in performance of orders of magnitude over a standard strategy. CID compares advantageously to the 3B operator while being simpler to implement. Experiments suggest to fix the CID-related parameter in 3BCID, offering thus to the user a promising variant of 3B.
For the entire collection see [Zbl 1142.68007].

MSC:

68T20 Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.)
PDFBibTeX XMLCite
Full Text: DOI

References:

[1] Barták, R., Erben, R.: A new Algorithm for Singleton Arc Consistency. In: Proc. FLAIRS (2004)
[2] Bessière, C., Debruyne, R.: Optimal and Suboptimal Singleton Arc Consistency Algorithms. In: Proc. IJCAI, pp. 54-59 (2005)
[3] Debruyne, R., Bessière, C.: Some Practicable Filtering Techniques for the Constraint Satisfaction Problem. In: Proc. IJCAI, pp. 412-417 (1997)
[4] Geelen, P.A.: Dual Viewpoint Heuristics for Binary Constraint Satisfaction Problems. In: Proc. ECAI 1992, pp. 31-35 (1992)
[5] Granvilliers, L.; Benhamou, F., RealPaver: An Interval Solver using Constraint Satisfaction Techniques, ACM Trans. on Mathematical Software, 32, 1, 138-156 (2006) · Zbl 1346.65020 · doi:10.1145/1132973.1132980
[6] Lebbah, Y.; Michel, C.; Rueher, M., A Rigorous Global Filtering Algorithm for Quadratic Constraints, Constraints Journal, 10, 1, 47-65 (2005) · Zbl 1066.90090 · doi:10.1007/s10601-004-5307-7
[7] Lhomme, O.: Consistency Tech. for Numeric CSPs. In: IJCAI, pp. 232-238 (1993)
[8] Lhomme, O.: Quick Shaving. In: Proc. AAAI, pp. 411-415 (2005)
[9] Min Li, C., Anbulagan: Heuristics Based on Unit Propagation for Satisfiability Problems. In: Proc. IJCAI, pp. 366-371 (1997)
[10] Neumaier, A., Interval Methods for Systems of Equations (1990), Cambridge: Cambridge University Press, Cambridge · Zbl 0715.65030
[11] Neveu, B.; Chabert, G.; Trombettoni, G.; Benhamou, F., When Interval Analysis helps Interblock Backtracking, Principles and Practice of Constraint Programming - CP 2006, 390-405 (2006), Heidelberg: Springer, Heidelberg · Zbl 1160.68557 · doi:10.1007/11889205_29
[12] Web page of COPRIN: www-sop.inria.fr/coprin/logiciels/ALIAS/Benches/benches.html COCONUT benchs: www.mat.univie.ac.at/ neum/glopt/coconut/Benchmark/Benchmark.html
[13] Refalo, P.; Wallace, M., Impact-Based Search Strategies for Constraint Programming, Principles and Practice of Constraint Programming - CP 2004, 557-571 (2004), Heidelberg: Springer, Heidelberg · Zbl 1152.68577
[14] Régin, J.C.: A Filtering Algorithm for Constraints of Difference in CSPs. In: Proc. AAAI, pp. 362-367 (1994)
[15] Simonis, H.: Sudoku as a Constraint Problem. In: CP Workshop on Modeling and Reformulating Constraint Satisfaction Problems, pp. 13-27 (2005)
[16] Van Hentenryck, P.; Michel, L.; Deville, Y., Numerica : A Modeling Language for Global Optimization (1997), Cambridge: MIT Press, Cambridge
[17] Van Hentenryck, P.; Saraswat, V.; Deville, Y., Design, Implementation, and Evaluation of the Constraint Language CC(FD), J. Logic Programming, 37, 1-3, 139-164 (1994) · Zbl 0920.68026
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.