An optimal k-consistency algorithm
Artificial Intelligence
Characterising tractable constraints
Artificial Intelligence
A Machine-Oriented Logic Based on the Resolution Principle
Journal of the ACM (JACM)
Synthesizing constraint expressions
Communications of the ACM
Chaff: engineering an efficient SAT solver
Proceedings of the 38th annual Design Automation Conference
Propositional Logic: Deduction and Algorithms
Propositional Logic: Deduction and Algorithms
Resolution versus Search: Two Strategies for SAT
Journal of Automated Reasoning
Efficient conflict driven learning in a boolean satisfiability solver
Proceedings of the 2001 IEEE/ACM international conference on Computer-aided design
SAT-Encodings, Search Space Structure, and Local Search Performance
IJCAI '99 Proceedings of the Sixteenth International Joint Conference on Artificial Intelligence
A Game-Theoretic Approach to Constraint Satisfaction
Proceedings of the Seventeenth National Conference on Artificial Intelligence and Twelfth Conference on Innovative Applications of Artificial Intelligence
CP '02 Proceedings of the 6th International Conference on Principles and Practice of Constraint Programming
The Quest for Efficient Boolean Satisfiability Solvers
CAV '02 Proceedings of the 14th International Conference on Computer Aided Verification
Hybrid backtracking bounded by tree-decomposition of constraint networks
Artificial Intelligence
Integrated Methods for Optimization (International Series in Operations Research & Management Science)
A combinatorial characterization of resolution width
Journal of Computer and System Sciences
Compiling finite linear CSP into SAT
Constraints
MINION: A Fast, Scalable, Constraint Solver
Proceedings of the 2006 conference on ECAI 2006: 17th European Conference on Artificial Intelligence August 29 -- September 1, 2006, Riva del Garda, Italy
Towards understanding and harnessing the potential of clause learning
Journal of Artificial Intelligence Research
A comparison of ATMS and CSP techniques
IJCAI'89 Proceedings of the 11th international joint conference on Artificial intelligence - Volume 1
Constraint Satisfaction Problems of Bounded Width
FOCS '09 Proceedings of the 2009 50th Annual IEEE Symposium on Foundations of Computer Science
CP'07 Proceedings of the 13th international conference on Principles and practice of constraint programming
MiniZinc: towards a standard CP modelling language
CP'07 Proceedings of the 13th international conference on Principles and practice of constraint programming
On the power of clause-learning SAT solvers with restarts
CP'09 Proceedings of the 15th international conference on Principles and practice of constraint programming
Clause-learning algorithms with many restarts and bounded-width resolution
Journal of Artificial Intelligence Research
ICALP'07 Proceedings of the 34th international conference on Automata, Languages and Programming
Representing and solving finite-domain constraint problems using systems of polynomials
Annals of Mathematics and Artificial Intelligence
| Hi-index | 0.00 |
Local consistency techniques such as k-consistency are a key component of specialised solvers for constraint satisfaction problems. In this paper we show that the power of using k-consistency techniques on a constraint satisfaction problem is precisely captured by using a particular inference rule, which we call negative-hyper-resolution, on the standard direct encoding of the problem into Boolean clauses. We also show that current clauselearning SAT-solvers will discover in expected polynomial time any inconsistency that can be deduced from a given set of clauses using negative-hyper-resolvents of a fixed size. We combine these two results to show that, without being explicitly designed to do so, current clause-learning SAT-solvers efficiently simulate k-consistency techniques, for all fixed values of k. We then give some experimental results to show that this feature allows clause-learning SAT-solvers to efficiently solve certain families of constraint problems which are challenging for conventional constraint-programming solvers.