A sufficient condition for backtrack-bounded search
Journal of the ACM (JACM)
A filtering algorithm for constraints of difference in CSPs
AAAI '94 Proceedings of the twelfth national conference on Artificial intelligence (vol. 1)
A machine program for theorem-proving
Communications of the ACM
Using Auxiliary Variables and Implied Constraints to Model Non-Binary Problems
Proceedings of the Seventeenth National Conference on Artificial Intelligence and Twelfth Conference on Innovative Applications of Artificial Intelligence
Performance measurement and analysis of certain search algorithms.
Performance measurement and analysis of certain search algorithms.
Heuristics based on unit propagation for satisfiability problems
IJCAI'97 Proceedings of the 15th international joint conference on Artifical intelligence - Volume 1
The difference all-difference makes
IJCAI'99 Proceedings of the 16th international joint conference on Artifical intelligence - Volume 1
IJCAI'99 Proceedings of the 16th international joint conference on Artificial intelligence - Volume 2
Neighborhood inverse consistency preprocessing
AAAI'96 Proceedings of the thirteenth national conference on Artificial intelligence - Volume 1
AAAI'96 Proceedings of the thirteenth national conference on Artificial intelligence - Volume 1
On Algorithms for Decomposable Constraints
SETN '02 Proceedings of the Second Hellenic Conference on AI: Methods and Applications of Artificial Intelligence
Fast Optimal Instruction Scheduling for Single-Issue Processors with Arbitrary Latencies
CP '01 Proceedings of the 7th International Conference on Principles and Practice of Constraint Programming
Solving a Telecommunications Feature Subscription Configuration Problem
CP '08 Proceedings of the 14th international conference on Principles and Practice of Constraint Programming
On the Efficiency of Impact Based Heuristics
CP '08 Proceedings of the 14th international conference on Principles and Practice of Constraint Programming
On the Integration of Singleton Consistencies and Look-Ahead Heuristics
Recent Advances in Constraints
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
Developing approaches for solving a telecommunications feature subscription problem
Journal of Artificial Intelligence Research
Journal of Artificial Intelligence Research
Lookahead in smodels compared to local consistencies in CSP
LPNMR'05 Proceedings of the 8th international conference on Logic Programming and Nonmonotonic Reasoning
Identifying and exploiting problem structures using explanation-based constraint programming
CPAIOR'05 Proceedings of the Second international conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
Dealing with Satisfiability and n-ary CSPs in a Logical Framework
Journal of Automated Reasoning
Activity-Based search for black-box constraint programming solvers
CPAIOR'12 Proceedings of the 9th international conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
| Hi-index | 0.00 |
We perform a comprehensive theoretical and empirical study of the benefits of singleton consistencies. Our theoretical results help place singleton consistencies within the hierarchy of local consistencies. To determine the practical value of these theoretical results, we measured the cost-effectiveness of pre-processing with singleton consistency algorithms. Our experiments use both random and structured problems. Whilst pre-processing with singleton consistencies is not in general beneficial for random problems, it starts to pay off when randomness and structure are combined, and it is very worthwhile with structured problems like Golomb rulers. On such problems, pre-processing with consistency techniques as strong as singleton generalized arc-consistency (the singleton extension of generalized arc-consistency) can reduce runtimes. We also show that limiting algorithms that enforce singleton consistencies to a single pass often gives a small reduction in the amount of pruning and improves their cost-effectiveness. These experimental results also demonstrate that conclusions from studies on random problems should be treated with caution.