A hybrid BDD and SAT finite domain constraint solver

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 3819 LNCS, Issue , 2005, Pages 103-117

  Hawkins, Peter ^a   Stuckey, Peter J ^a  

^a UNIVERSITY OF MELBOURNE   (Australia)

Author keywords

[No Author keywords available]

Indexed keywords

BOOLEAN ALGEBRA; HEURISTIC PROGRAMMING; LEARNING ALGORITHMS; OPTIMIZATION; PROBLEM SOLVING; SET THEORY;

BINARY DECISION DIAGRAMS (BDD); BOOLEAN FORMULAE; FINITE-DOMAIN CONSTRAINT SOLVERS; SATISFIABILITY (SAT);

CONSTRAINT THEORY;

EID: 33745457003     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11603023_8     Document Type: Conference Paper

References (23)

1. K. Apt and E. Monfroy. Constraint programming viewed as rule-based programming. TPLP, 1(6):713-750, 2001.
2. C. Bessière and J.-C. Regin. MAC and combined heuristics: Two reasons to forsake FC (and CBJ?) on hard problems. In Proceedings of CP96, LNCS. Springer, 1996.
3. R. E. Bryant. Symbolic Boolean manipulation with ordered binary-decision diagrams. ACM Comput. Surv., 24(3):293-318, 1992. ISSN 0360-0300.
4. C. Choi, J. Lee, and P. J. Stuckey. Propagation redundancy in redundant modelling. In F. Rossi, editor, Proceedings of CP2003, volume 2833 of LNCS, pages 229-243. Springer-Verlag, 2003.
5. R. Damiano and J. Kukula. Checking satisfiability of a conjunction of BDDs. In Proceedings of DAC '03, pages 818-823, New York, NY, USA, 2003. ACM Press.
6. M. Davis, G. Logemann, and D. Loveland. A machine program for theoremproving. Communications of the ACM, 5:394-397, 1962.
7. R. Dechter. Constraint Processing. Morgan Kaufmann, 2003.
8. N. Eén and N. Sörensson. An extensible SAT-solver. In E. Giunchiglia and A. Tacchella, editors, Proceedings of SAT 2003, volume 2919 of LNCS, pages 502-518, May 2003.
9. N. Eén and N. Sörensson. Minisat+. http://www.cs.chalmers.se/ Cs/Research/FormalMethods/MiniSat/MiniSat+.html, 2005.
10. P. Hawkins, V. Lagoon, and P. J. Stuckey. Solving set constraint satisfaction problems using ROBDDs. Journal of Artificial Intelligence Research, 24:109-156, July 2005.
11. U. Junker. QUICKXPLAIN: Conflict detection for arbitrary constraint propagation algorithms. In IJCAI'01 Workshop on Modelling and Solving problems with constraints (CONS-1), 2001.
12. N. Jussien and V. Barichard. The PaLM system: explanation-based constraint programming. In Proceedings of TRICS: Techniques foR Implementing Constraint programming Systems, a post-conference workshop of CP 2000, pages 118-133, 2000.
13. N. Jussien, R. Debruyne, and P. Boizumault. Maintaining arc-consistency within dynamic backtracking. In Proceedings of CP2000, volume 1894 of LNCS, pages 249-261, Singapore, Sept. 2000. Springer-Verlag.
14. G. Katsirelos and F. Bacchus. Unrestricted nogood recording in CSP search. In Proceedings of CP2003, volume 2833 of LNCS, pages 873-877. Springer, 2003.
15. K. Marriott and P. J. Stuckey. Programming with Constraints: an Introduction. The MIT Press, 1998.
16. M. Moskewicz, C. Madigan, Y. Zhao, L. Zhang, and S. Malik. Chaff: Engineering an efficient SAT solver. In 39th Design Automation Conference (DAC 2001), June 2001.
17. P. Prosser. Hybrid algorithms for the constraint satisfaction search. Computational Intelligence, 9(3):268-299, 1993.
18. F. Somenzi. CUDD: Colorado University Decision Diagram package. [Online, accessed 31 May 2004], Feb. 2004. http://vlsi.colorado.edu/~fabio/CUDD/.
19. Z. Somogyi, F. Henderson, and T. Conway. The execution algorithm of Mercury, an efficient purely declarative logic programming language. Journal of Logic Programming, 29(1-3):17-64, 1996.
20. C. Thiffault, F. Bacchu, and T. Walsh. Solving non-clausal formulas with DPLL search. In Proceedings of CP2004, volume 3258 of LNCS, pages 663-678. Springer, 2004.
21. T. Walsh. SAT vs CSP. In Proceedings of CP2000, volume 1894 of LNCS, pages 441-456. Springer, 2000.
22. L. Zhang and S. Malik. The quest for efficient Boolean satisfiability solvers. In Proceedings of CAV2002, volume 2404 of LNCS, pages 17-36, July 2002.
23. L. Zhang, C. Madigan, M. Moskewicz, and S. Malik. Efficient conflict driven learning in a Boolean satisfiability solver. In Proceedings of International Conference on Computer Design (ICCAD), pages 279-285, 2001.