Abstract
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.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Cadoli, M., Mancini, T.: Using a theorem prover for reasoning on constraint problems. In: Bandini, S., Manzoni, S. (eds.) AI*IA 2005. LNCS (LNAI), vol. 3673, pp. 38–49. Springer, Heidelberg (2005)
Cadoli, M., Mancini, T.: Automated reformulation of specifications by safe delay of constraints. Artif. Intell. (to appear, 2006)
Cadoli, M., Schaerf, A.: Compiling problem specifications into SAT. Artif. Intell. 162, 89–120 (2005)
Crawford, J.M., Ginsberg, M.L., Luks, E.M., Roy, A.: Symmetry-breaking predicates for search problems. In: Proc. of KR 1996, pp. 148–159. Morgan Kaufmann, San Francisco (1996)
Fourer, R., Gay, D.M., Kernigham, B.W.: AMPL: A Modeling Language for Mathematical Programming. Intl. Thomson Publ. (1993)
Hoos, H.H.: Stochastic Local Search - Methods, Models, Applications. PhD thesis, TU Darmstadt (1998)
Kautz, H., Selman, B.: Pushing the envelope: Planning, propositional logic, and stochastic search. In: Proc.of AAAI 1996, pp. 1194–1201. AAAI Press/The MIT Press (1996)
Leone, N., Pfeifer, G., Faber, W., Eiter, T., Gottlob, G., Perri, S., Scarcello, F.: The DLV System for Knowledge Representation and Reasoning. ACM Trans. on Comp. Logic (to appear)
Mancini, T., Cadoli, M.: Detecting and breaking symmetries by reasoning on problem specifications. In: Zucker, J.-D., Saitta, L. (eds.) SARA 2005. LNCS (LNAI), vol. 3607, pp. 165–181. Springer, Heidelberg (2005)
Michel, L., Van Hentenryck, P.: Localizer. Constraints 5(1), 43–84 (2000)
Moskewicz, M.W., Madigan, C.F., Zhao, Y., Zhang, L., Malik, S.: Chaff: Engineering an Efficient SAT Solver. In: Proc. of DAC 2001, pp. 530–535. ACM Press, New York (2001)
Prestwich, S.D., Roli, A.: Symmetry breaking and local search spaces. In: Barták, R., Milano, M. (eds.) CPAIOR 2005. LNCS, vol. 3524, pp. 273–287. Springer, Heidelberg (2005)
Puget, J.-F.: On the satisfiability of symmetrical constrained satisfaction problems. In: Komorowski, J., Raś, Z.W. (eds.) ISMIS 1993. LNCS, vol. 689, pp. 350–361. Springer, Heidelberg (1993)
Selman, B., Kautz, H.A., Cohen, B.: Local search strategies for satisfiability testing. In: Proc. of DIMACS Challenge on Cliques, Coloring, and Sat. (1993)
Van Hentenryck, P.: The OPL Optimization Programming Language. The MIT Press, Cambridge (1999)
Zhang, W., Rangan, A., Looks, M.: Backbone guided local search for maximum satisfiability. In: Proc. of IJCAI 2003, pp. 1179–1186. Morgan Kaufmann, San Francisco (2003)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Cadoli, M., Mancini, T., Patrizi, F. (2006). SAT as an Effective Solving Technology for Constraint Problems. In: Esposito, F., Raś, Z.W., Malerba, D., Semeraro, G. (eds) Foundations of Intelligent Systems. ISMIS 2006. Lecture Notes in Computer Science(), vol 4203. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11875604_61
Download citation
DOI: https://doi.org/10.1007/11875604_61
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-45764-0
Online ISBN: 978-3-540-45766-4
eBook Packages: Computer ScienceComputer Science (R0)