A lightweight component caching scheme for satisfiability solvers

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

Volumn 4501 LNCS, Issue , 2007, Pages 294-299

  Pipatsrisawat, Knot ^a   Darwiche, Adnan ^a  

^a UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

NUMERICAL METHODS; PROBLEM SOLVING;

LIGHTWEIGHT COMPONENT CACHING; SATISFIABILITY SOLVERS;

BUFFER STORAGE;

EID: 38049098489     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-72788-0_28     Document Type: Conference Paper

References (20)

1. ALOUL, F., MARKOV, I., AND SAKALLAH, K. Force: a fast and easy-to-implement variable-ordering heuristic. In Proc. of the 13th ACM Great Lakes Symposium on VLSI 2003. pp. 116-119. (2003).
2. BAYARDO, R. J. J., AND SCHRAG, R. C. Using CSP look-back techniques to solve real-world SAT instances. In AAAI'97 (Providence, Rhode Island), pp. 203-208.
3. BEAME, P., IMPAGLIAZZO, R., PITASSI, T., AND SEGERLIND, N. Memoization and dpll: Formula caching proof systems. In Proc. of 18th Annual IEEE Conf. on Computational Complexity, Aarhus, Denmark. (2003).
4. BIERE, A., AND SINZ, C. Decomposing sat problems into connected components. Journal on Satisfiability, Boolean Modeling and Computation (JSAT) 2 (2006).
5. DARWICHE, A. New advances in compiling CNF to decomposable negational normal form. In Proc. of European Conference on AI. (2004).
6. DURAIRAJ, V., AND KALLA., P. Variable ordering for efficient sat search by analyzing constraint-variable dependencies. In SAT'05 (August 2005).
7. EÉN, N., AND SÖRENSSON, N. An extensible sat-solver. In SAT'03 (2003).
8. GINSBERG, M. L. Dynamic backtracking. Jrnl of Artf. Intel. Resrh. 1 (1993).
9. HUANG, J., AND DARWICHE, A. A structure-based variable ordering heuristic for sat. In (IJCAI'03) (2003), pp. 1167-1172.
10. IBM. Ibm formal verification benchmark library, http://www.research.ibm. com/haifa/projects/verification/RB_Homepage/fvbenchmarks.html.
11. MARQUES-SILVA, J. P., AND SAKALLAH, K. A. GRASP - A New Search Algorithm for Satisfiability. In Proceedings of IEEE/ACM International Conference on Computer-Aided Design (1996), pp. 220-227.
12. PIPATSRISAWAT, K., AND DARWICHE, A. SAT Solver Description: RSat.
13. ROBERTO J. BAYARDO, J., AND PEHOUSHEK, J. D. Counting models using connected components. In Proc. of the 17th Natl. Conf. on AI. (2000), AAAI Press / The MIT Press, pp. 157-162.
14. Rsat sat solver homepage. http://reasoning.cs.ucla.edu/rsat.
15. SANG, T., BACCHUS, F., BEAME, P., KAUTZ, H. A., AND PITASSI, T. Combining component caching and clause learning for effective model counting. In SAT'04.
16. SANG, T., BEAME, P., AND KAUTZ, H. A. Heuristics for fast exact model counting. In SAT (2005), pp. 226-240.
17. SAT'05 Competition Homepage, http://www.satcompetition.org/2005/.
18. STALLMAN, R., AND SUSSMAN, G. Forward reasoning and dependency-directed backtracking in a system for computer-aided circuit analysis. Artf. Intel. 9 (1977).
19. VELEV, M. N. Sat bnchmrk lib. www.miroslav-velev.com/sat. benchmarks.html.
20. ZHANG, L., MADIGAN, C. F., MOSKEWICZ, M. W., AND MALIK, S. Efficient conflict driven learning in boolean satisfiability solver. In ICCAD (2001), pp. 279-285.