Dual viewpoint heuristics for binary constraint satisfaction problems
ECAI '92 Proceedings of the 10th European conference on Artificial intelligence
A filtering algorithm for constraints of difference in CSPs
AAAI '94 Proceedings of the twelfth national conference on Artificial intelligence (vol. 1)
Algorithm 852: RealPaver: an interval solver using constraint satisfaction techniques
ACM Transactions on Mathematical Software (TOMS)
AAAI'05 Proceedings of the 20th national conference on Artificial intelligence - Volume 1
Consistency techniques for numeric CSPs
IJCAI'93 Proceedings of the 13th international joint conference on Artifical intelligence - Volume 1
Heuristics based on unit propagation for satisfiability problems
IJCAI'97 Proceedings of the 15th international joint conference on Artifical intelligence - Volume 1
Optimal and suboptimal singleton arc consistency algorithms
IJCAI'05 Proceedings of the 19th international joint conference on Artificial intelligence
When interval analysis helps inter-block backtracking
CP'06 Proceedings of the 12th international conference on Principles and Practice of Constraint Programming
Exploiting Common Subexpressions in Numerical CSPs
CP '08 Proceedings of the 14th international conference on Principles and Practice of Constraint Programming
Filtering numerical CSPs using well-constrained subsystems
CP'09 Proceedings of the 15th international conference on Principles and practice of constraint programming
Making adaptive an interval constraint propagation algorithm exploiting monotonicity
CP'10 Proceedings of the 16th international conference on Principles and practice of constraint programming
ICN-RE: redundancy elimination for information-centric networking
Proceedings of the second edition of the ICN workshop on Information-centric networking
Adaptive bisection of numerical CSPs
CP'12 Proceedings of the 18th international conference on Principles and Practice of Constraint Programming
Hi-index | 0.00 |
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.