The OPL optimization programming language
The OPL optimization programming language
Chaff: engineering an efficient SAT solver
Proceedings of the 38th annual Design Automation Conference
Constraints
On the Satisfiability of Symmetrical Constrained Satisfaction Problems
ISMIS '93 Proceedings of the 7th International Symposium on Methodologies for Intelligent Systems
The DLV system for knowledge representation and reasoning
ACM Transactions on Computational Logic (TOCL)
Backbone guided local search for maximum satisfiability
IJCAI'03 Proceedings of the 18th international joint conference on Artificial intelligence
Compiling problem specifications into SAT
Artificial Intelligence - Special volume on reformulation
Automated reformulation of specifications by safe delay of constraints
Artificial Intelligence
Pushing the envelope: planning, propositional logic, and stochastic search
AAAI'96 Proceedings of the thirteenth national conference on Artificial intelligence - Volume 2
Using a theorem prover for reasoning on constraint problems
AI*IA'05 Proceedings of the 9th conference on Advances in Artificial Intelligence
Symmetry breaking and local search spaces
CPAIOR'05 Proceedings of the Second international conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
Detecting and breaking symmetries by reasoning on problem specifications
SARA'05 Proceedings of the 6th international conference on Abstraction, Reformulation and Approximation
The log-support encoding of CSP into SAT
CP'07 Proceedings of the 13th international conference on Principles and practice of constraint programming
A system for solving constraint satisfaction problems with SMT
SAT'10 Proceedings of the 13th international conference on Theory and Applications of Satisfiability Testing
| Hi-index | 0.01 |
In this paper we investigate the use of SAT technology for solving constraint problems. In particular, we solve many instances of several common benchmark problems for CP with different SAT solvers, by exploiting the declarative modelling language NPSpec, and Spec2Sat, an application that allows us to compile NPSpec specifications into SAT instances. Furthermore, we start investigating whether some reformulation techniques already used in CP are effective when using SAT as solving engine. We present encouraging experimental results in this direction, showing that this approach can be appealing.