Fast set bounds propagation using a BDD-SAT hybrid

Journal of Artificial Intelligence Research

Volumn 38, Issue , 2010, Pages 307-338

  Gange, Graeme ^a   Stuckey, Peter J ^a   Lagoon, Vitaly ^b  

^a UNIVERSITY OF MELBOURNE   (Australia)

^b CADENCE DESIGN SYSTEMS   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

CONSTRAINT SATISFACTION PROBLEMS; CONSTRAINT SOLVERS; LEARNING ABILITIES; SAT SOLVERS; SET CONSTRAINTS; SOLVING SET;

BINARY DECISION DIAGRAMS;

DECISION THEORY;

EID: 77955452167     PISSN: None     EISSN: 10769757     Source Type: Journal    
DOI: 10.1613/jair.3014     Document Type: Article

References (29)

1. Azevedo, F. (2002). Constraint Solving over Multi-valued Logics. Ph.D. thesis, Faculdade de Ciências e Tecnologia, Universidade Nova de Lisboa.
2. Azevedo, F. (2007). Cardinal: A finite sets constraint solver. Constraints, 12(1), 93-129.
3. Bryant, R. (1986). Graph-based algorithms for Boolean function manipulation. IEEE Trans. Comput., 35(8), 677-691.
4. Cheng, K., & Yap, R. (2008). Maintaining generalized arc consistency on ad hoc r-ary constraints. In 14th International Conference on Principles and Process of Constraint Programming, pp. 509-523.
5. Damiano, R., & Kukula, J. (2003). Checking satisfiability of a conjunction of BDDs. In Proceedings of Design Automation Conference, pp. 818-823.
6. Davis, M., Logemann, G., & Loveland, D. (1962). A machine program for theorem-proving. Communications of the ACM, 5, 394-397.
7. Eén, N., & Sörensson, N. (2003). An extensible SAT-solver. In Giunchiglia, E., & Tacchella, A. (Eds.), Proceedings of SAT 2003, Vol.2919 of LNCS, pp. 502-518.
8. Eén, N., & Sörensson, N. (2006). Translating pseudo-boolean constraints into SAT. Journal on Satisfiability, Boolean Modeling and Computation, 2, 1-26.
9. Gange, G., Lagoon, V., & Stuckey, P. (2008). Fast set bounds propagation using BDDs. In 18th European Conference on Artificial Intelligence, pp. 505-509.
10. GECODE (2008). Gecode. www.gecode.org. Accessed Jan 2008.
11. Gervet, C. (1997). Interval propagation to reason about sets: Definition and implementation of a practical language. Constraints, 1(3), 191-246.
12. Gervet, C., & Van Hentenryck, P. (2006). Length-lex ordering for set CSPs. In Proceedings of the National Conference on Artificial Intelligence, pp. 48-53.
13. Hawkins, P., Lagoon, V., & Stuckey, P. (2004). Set bounds and (split) set domain propagation using ROBDDs. In 17th Australian Joint Conference on Artificial Intelligence, Vol.3339 of LNCS, pp. 706-717.
14. Hawkins, P., Lagoon, V., & Stuckey, P. (2005). Solving set constraint satisfaction problems using ROBDDs. Journal of Artificial Intelligence Research, 24, 106-156.
15. Hawkins, P., & Stuckey, P. (2006). A hybrid BDD and SAT finite domain constraint solver. In Proceedings of the 8th International Symposium on Practical Aspects of Declarative Languages, Vol.3819 of LNCS, pp. 103-117.
16. IC-PARC 2003 The ECLiPSe constraint logic programming system. [Online, accessed Oct 2008] http://www.eclipse-clp.org/.
17. ILOG (2004) ILOG Solver. [Online, accessed Oct 2008]. http://www.ilog.com/.
18. Lagoon, V., & Stuckey, P. (2004). Set domain propagation using ROBDDs. In Proceedings of the 10th International Conference on Principles and Practice of Constraint Programming, Vol.3258 of LNCS, pp. 347-361.
19. van Lint, J. H., & Wilson, R. M. (2001). A Course in Combinatorics (2nd edition). Cambridge University Press.
20. Müller, T. (2001). Constraint Propagation in Mozart. Doctoral dissertation, Universität des Saarlandes, Naturwissenschaftlich-Technische Fakultät I, Fachrichtung Informatik, Saarbrücken, Germany.
21. Ohrimenko, O., Stuckey, P., & Codish, M. (2007). Propagation = lazy clause generation. In Bessiere, C. (Ed.), Proceedings of the 13th International Conference on Principles and Practice of Constraint Programming, Vol.4741 of LNCS, pp. 544-558. Springer- Verlag.
22. Ohrimenko, O., Stuckey, P., & Codish, M. (2009). Propagation via lazy clause generation. Constraints, 14(3), 357-391.
23. Puget, J.-F. (1992). PECOS: A high level constraint programming language. In Proceedings of SPICIS'92, Singapore.
24. Puget, J.-F. (2005). Symmetry breaking revisited. Constraints, 10(1), 23-46.
25. Sadler, A., & Gervet, C. (2004). Hybrid set domains to strengthen constraint propagation and reduce symmetries. In Wallace, M. (Ed.), Proceedings of the 10th International Conference on Principles and Practice of Constraint Programming (CP04), No.3258 in LNCS. Springer-Verlag.
26. SICS (2009). Sicstus prolog. www.sics.se/sicstus.
27. Subbarayan, S. (2008). Efficent reasoning for nogoods in constraint solvers with BDDs. In Proceedings of Tenth International Symposium on Practical Aspects of Declarative Languages, Vol.4902 of LNCS, pp. 53-57.
28. Tseitin, G. (1968). On the complexity of derivation in propositional calculus. Studies in Constructive Mathematics and Mathematical Logic, Part 2, 115-125.
29. Yip, J., & Van Hentenryck, P. (2009). Evaluation of length-lex set variables. In Proceedings of the 15th International Conference on Principles and Practice of Constraint Programming, pp. 817-832.