Compiling finite domain constraints to SAT with BEE*

Theory and Practice of Logic Programming

Volumn 12, Issue 4-5, 2012, Pages 465-483

  Metodi, Amit ^a   Codish, Michael ^a  

^a BEN GURION UNIVERSITY OF THE NEGEV   (Israel)

Author keywords

equi propagation; FD constraints; partial evaluation; SAT encoding

Indexed keywords

ENCODING PROCESS; ENCODINGS; EQUI-PROPAGATION; FD CONSTRAINTS; FINITE DOMAIN CONSTRAINTS; PARTIAL EVALUATION; SAT SOLVERS;

LOGIC PROGRAMMING; OPTIMIZATION; PROGRAM COMPILERS;

ENCODING (SYMBOLS);

EID: 84871956927     PISSN: 14710684     EISSN: 14753081     Source Type: Journal    
DOI: 10.1017/S1471068412000130     Document Type: Conference Paper

References (30)

1. Ansó tegui, C., del Val, A., Dotú, I., Fernández, C. and Manyà, F. 2004. Modeling choices in quasigroup completion: SAT vs. CSP. In AAAI, D. L. McGuinness and G. Ferguson, Eds. AAAI Press /The MIT Press, San Jose, California, USA, 137-142.
2. As'in, R., Nieuwenhuis, R., Oliveras, A. and Rodr'iguez-Carbonell, E. 2011. Cardinality networks: A theoretical and empirical study. Constraints 16, 2, 195-221.
3. Bailleux, O. and Boufkhad, Y. 2003. Efficient CNF encoding of Boolean cardinality constraints. In CP, F. Rossi, Ed. LNCS, vol. 2833. Springer, Kinsale, Ireland, 108-122.
4. Batcher, K. E. 1968. Sorting networks and their applications. In AFIPS Spring Joint Computing Conference. AFIPS Conference Proceedings, vol. 32. Thomson Book Company, Washington D.C., Atlantic City, NJ, USA, 307-314.
5. Cadoli, M. and Schaerf, A. 2005. Compiling problem specifications into SAT. Artificial Intelligence 162, 1-2, 89-120. (Pubitemid 40034595)
6. Chen, J. 2010. A new sat encoding of the at-Most-one constraint. Workshop on Constraint Modeling and Reformulation (ModRef 2010) http://www.it.uu.se/ research/group/ astra/ModRef10/programme.html
7. Codish, M., Lagoon, V. and Stuckey, P. J. 2008. Logic programming with satisfiability. TPLP 8, 1, 121-128. (Pubitemid 350231352)
8. Codish, M. and Zazon-Ivry, M. 2010. Pairwise cardinality networks. In LPAR (Dakar), E. M. Clarke and A. Voronkov, Eds. Lecture Notes in Computer Science, vol. 6355. Springer, 154-172.
9. Crawford, J. M. and Baker, A. B. 1994. Experimental results on the application of satisfiability algorithms to scheduling problems. In AAAI, B. Hayes-Roth and R. E. Korf, Eds. vol. 2. AAAI Press /The MIT Press, Seattle, WA, USA, 1092-1097.
10. E'en, N. and S̈orensson, N. 2003. An extensible SAT-solver. In SAT, E. Giunchiglia and A. Tacchella, Eds. LNCS, vol. 2919. Springer, Santa Margherita Ligure, Italy, 502-518.
11. Éen, N. and S̈orensson, N. 2006. Translating pseudo-boolean constraints into SAT. Journal on Satisfiability, Boolean Modeling and Computation (JSAT) 2, 1-4, 1-26.
12. Feldman, A., Provan, G., de Kleer, J., Robert, S. and van Gemund, A. 2010. Solving modelbased diagnosis problems with max-sat solvers and vice versa. https://www.phmsociety. org/events/workshop/dx/10/proceedings
13. Frisch, A. M. and Giannaros, P. A. 2010. SAT encodings of the at-Most-k constraint: Some old, some new, some fast, some slow.Workshop on ConstraintModeling and Reformulation (ModRef 2010) http://www.it.uu.se/research/ group/astra/ModRef10/programme. html
14. Frutos, A. G., Liu, Q., Thiel, A. J., Sanner, A. M. W., Condon, A. E., Smith, L. M. and Corn, R. M. 1997. Demonstration of a word design strategy for DNA computing on surfaces. Journal of Nucleic Acids Research 25, 23, 4748-4757. (Pubitemid 27517208)
15. Gallian, J. A. 2011. A dynamic survey of graph labeling. The Electronic Journal of Combinatorics 18.
16. Gavanelli, M. 2007. The log-support encoding of csp into sat. In CP, C. Bessiere, Ed. LNCS, vol. 4741. Springer, Providence, RI, USA, 815-822.
17. Gomes, C. P., Selman, B. and Crato, N. 1997. Heavy-Tailed distributions in combinatorial search. In CP, G. Smolka, Ed. LNCS, vol. 1330. Springer, 121-135.
18. J̈ager, G. 2010. An effective sat encoding for magic labeling. In CTW, U. Faigle, R. Schrader, and D. Herrmann, Eds. 97-100.
19. MacDougall, J., Miller, M., Slamin, M. and Wallis, W. 2002. Vertex-Magic total labelings of graphs. Utilitas Mathematica 61, 3-21.
20. Mancini, T., Micaletto, D., Patrizi, F. and Cadoli, M. 2008. Evaluating ASP and commercial solvers on the CSPLib. Constraints 13, 4, 407-436.
21. Metodi, A. 2012. BEE. http://amit.metodi.me/research/bee/.
22. Metodi, A., Codish, M., Lagoon, V. and Stuckey, P. J. 2011. Boolean equi-propagation for optimized SAT encoding. In CP, J. H.-M. Lee, Ed. LNCS, vol. 6876. Springer, 621-636.
23. Metodi, A., Stern, R., Kalech, M. and Codish, M. 2012. Compiling Model-based Diagnosis to Boolean Satisfaction. Techical rep., Department of Computer Science, Ben-Gurion University. URL: Www.cs.bgu.ac.il/~mcodish/Papers/ Sources/satMBD.pdf
24. Nethercote, N., Stuckey, P. J., Becket, R., Brand, S., Duck, G. J. and Tack, G. 2007. MiniZinc: Towards a standard CP modelling language. In Principles and Practice of Constraint Programming, C. Bessiere, Ed. LNCS, vol. 4741. Springer-Verlag, 529-543.
25. R'egin, J.-C. 1994. A filtering algorithm for constraints of difference in csps. In AAAI, B. Hayes-Roth and R. E. Korf, Eds. AAAI Press /The MIT Press, 362-367.
26. Reiter, R. 1987. A theory of diagnosis from first principles. Artificial Intelligence 32, 1, 57-96.
27. Smith, A., Veneris, A., Ali, M. F. and Viglas, A. 2005. Fault diagnosis and logic debugging using Boolean satisfiability. IEEE TRANS. ON CAD 24, 1606-1621.
28. Soos, M. 2010. CryptoMiniSAT, v2.5.1. http://www.msoos.org/ cryptominisat2.
29. Tamura, N., Taga, A., Kitagawa, S. and Banbara, M. 2009. Compiling finite linear CSP into SAT. Constraints 14, 2, 254-272.
30. van Hentenryck, P. 1999. The OPL Optimization Programming Language. MIT Press