On the parallel complexity of discrete relaxation in constraint satisfaction networks
Artificial Intelligence
A machine program for theorem-proving
Communications of the ACM
Chaff: engineering an efficient SAT solver
Proceedings of the 38th annual Design Automation Conference
SAT-Encodings, Search Space Structure, and Local Search Performance
IJCAI '99 Proceedings of the Sixteenth International Joint Conference on Artificial Intelligence
Solving non-Boolean satisfiability problems with stochastic local search
IJCAI'01 Proceedings of the 17th international joint conference on Artificial intelligence - Volume 1
Compiling problem specifications into SAT
Artificial Intelligence - Special volume on reformulation
SAT as an effective solving technology for constraint problems
ISMIS'06 Proceedings of the 16th international conference on Foundations of Intelligent Systems
CP'06 Proceedings of the 12th international conference on Principles and Practice of Constraint Programming
SAT Encoding and CSP Reduction for Interconnected Alldiff Constraints
MICAI '09 Proceedings of the 8th Mexican International Conference on Artificial Intelligence
Modelling Max-CSP as partial Max-SAT
SAT'08 Proceedings of the 11th international conference on Theory and applications of satisfiability testing
A SAT-based Method for Solving the Two-dimensional Strip Packing Problem
Fundamenta Informaticae - RCRA 2008 Experimental Evaluation of Algorithms for Solving Problems with Combinatorial Explosion
Generating combinatorial test cases by efficient SAT encodings suitable for CDCL SAT solvers
LPAR'10 Proceedings of the 17th international conference on Logic for programming, artificial intelligence, and reasoning
Solving constraint satisfaction problems with SAT technology
FLOPS'10 Proceedings of the 10th international conference on Functional and Logic Programming
Azucar: a SAT-based CSP solver using compact order encoding
SAT'12 Proceedings of the 15th international conference on Theory and Applications of Satisfiability Testing
Compiling finite domain constraints to sat with bee*
Theory and Practice of Logic Programming
Boolean equi-propagation for concise and efficient SAT encodings of combinatorial problems
Journal of Artificial Intelligence Research
Scarab: a rapid prototyping tool for SAT-based constraint programming systems
SAT'13 Proceedings of the 16th international conference on Theory and Applications of Satisfiability Testing
| Hi-index | 0.01 |
Various encodings have been proposed to convert Constraint Satisfaction Problems (CSP) into Boolean Satisfiability problems (SAT). Some of them use a logical variable for each element in each domain: among these very successful are the direct and the support encodings. Other methods, such as the log-encoding, use a logarithmic number of logical variables to encode domains. However, they lack the propagation power of the direct and support encodings, so many SAT solvers perform poorly on log-encoded CSPs. In this paper, we propose a new encoding, called log-support, that combines the log and support encodings. It has a logarithmic number of variables, and uses support clauses to improve propagation. We also extend the encoding using a Gray code. We provide experimental results on Job-Shop scheduling and randomly-generated problems.