A filtering algorithm for constraints of difference in CSPs
AAAI '94 Proceedings of the twelfth national conference on Artificial intelligence (vol. 1)
Random Structures & Algorithms
A polynomial-time approximation algorithm for the permanent of a matrix with non-negative entries
STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
Clifford algebras and approximating the permanent
STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
Active-constraint variable ordering for faster feasibility of mixed integer linear programs
Mathematical Programming: Series A and B
Model counting: a new strategy for obtaining good bounds
AAAI'06 Proceedings of the 21st national conference on Artificial intelligence - Volume 1
Counting solutions of CSPs: a structural approach
IJCAI'05 Proceedings of the 19th international joint conference on Artificial intelligence
VARSAT: Integrating Novel Probabilistic Inference Techniques with DPLL Search
SAT '09 Proceedings of the 12th International Conference on Theory and Applications of Satisfiability Testing
Counting solutions of knapsack constraints
CPAIOR'08 Proceedings of the 5th international conference on Integration of AI and OR techniques in constraint programming for combinatorial optimization problems
Confidence-based work stealing in parallel constraint programming
CP'09 Proceedings of the 15th international conference on Principles and practice of constraint programming
Evaluating and Improving Modern Variable and Revision Ordering Strategies in CSPs
Fundamenta Informaticae - RCRA 2008 Experimental Evaluation of Algorithms for Solving Problems with Combinatorial Explosion
Upper bounds on the number of solutions of binary integer programs
CPAIOR'10 Proceedings of the 7th international conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
Hi-index | 0.00 |
Constraints have played a central role in cp because they capture key substructures of a problem and efficiently exploit them to boost inference. This paper intends to do the same thing for search, proposing constraint-centered heuristics which guide the exploration of the search space toward areas that are likely to contain a high number of solutions. We first propose new search heuristics based on solution counting information at the level of individual constraints. We then describe efficient algorithms to evaluate the number of solutions of two important families of constraints: occurrence counting constraints, such as alldifferent, and sequencing constraints, such as regular. In both cases we take advantage of existing filtering algorithms to speed up the evaluation. Experimental results on benchmark problems show the effectiveness of our approach.