SBSAT: A state-based, BDD-based satisfiability solver

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

Volumn 2919, Issue , 2004, Pages 398-410

  Franco, John ^a   Kouril, Michal ^a   Schlipf, John ^a   Ward, Jeffrey ^a   Weaver, Sean ^a   Dransfield, Michael ^b   Mark Vanfleet, W ^b  

^a UNIVERSITY OF CINCINNATI   (United States)

^b Department of Defense ^*  (United States)

Author keywords

Binary Decision Diagram; DAG; Satisfiability; State Machine

Indexed keywords

BINARY DECISION DIAGRAMS; DECISION THEORY; FORMAL LOGIC; HEURISTIC ALGORITHMS;

BOOLEAN CONSTRAINT; DAG; EFFICIENT IMPLEMENTATION; PREPROCESSING PHASE; SATISFIABILITY; SATISFIABILITY SOLVERS; SEARCH INFORMATION; STATE MACHINE;

BOOLEAN FUNCTIONS;

EID: 35048816471     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-24605-3_30     Document Type: Article

References (25)

1. [BCCZ] Biere, A., A. Cimatti, E. Clarke, and Y. Zhu. Symbolic Model Checking without BDDs. TACAS 1999. Lecture Notes in Computer Science 1579 (1999).
2. [Bra90] Brace, K.S., R.L. Rudell, and R.E. Bryant. Efficient Implementation of a BDD Package. ACM Proceedings of the 27th ACM/IEEE Design Automation Conference (1990) 40-45.
3. [Bry86] Bryant, R.E.: Graph-Based Algorithms for Boolean Function Manipulation. IEEE Transactions on Computers C-35 (1986) 677-691.
4. [CGPRST01] Cimatti, A., E. Giunchiglia, M. Pistore, M. Roveri, R. Sebastiani, and A. Tacchella.: NuSMV Version 2: BDD-Based + SAT-Based Symbolic Model Checking. Available from http://sra.itc.it/people/roveri/papers/IJCAR01. ps.gz.
5. [CM90] Coudert, O., and J.C. Madre: A Unified Framework for the Formal Verification of Sequential Circuits, Proc. of Int'l Conf. on Computer-Aided Design, 1990, pp. 126-129.
6. [CM91] Coudert, O., and J.C. Madre: Symbolic Computation of the Valid States of a Sequential Machine: Algorithms and Discussion. Proc. of Int'l Worshop on Formal Methods in VLSI Design, Miami FL, USA, January 1991.
7. [DLL62] Davis, M., G. Logemann, and D. Loveland.: A Machine Program for Theorem Proving. Communications of the Association of Computing Machinery 5 (1962) 394-397.
8. [Fre95] Freeman, J.: Improvements to Propositional Satisfiability Search Algorithms. Ph.D. Dissertation in Computer and Information Science, University of Pennsylvania, 1995.
9. [GS99] Giunchiglia, E., and R. Sebastiani.: Applying the Davis-Putnam Procedure to Non-Clausal Formulas. Proceedings of AI*IA '99, Lecture Notes in Artificial Intelligence, #1792, Springer Verlag, 1999.
10. [Go102] Goldberg, E.: Testing Satisfiability of CNF Formulas by Computing a Stable Set of Points. Proceedings of the Fifth International Symposium on the Theory and Applications of Satisfiability Testing (2002) 54-69. (Available from: http://gauss.ececs.uc.edu/Conferences/SAT2002/Abstracts/goldberg.ps Expanded version submitted for publication.)
11. [GN02] Goldberg, E., and Y. Novikov.: BerkMin: A Fast and Robust Sat-Solver Design. Proceedings Design, Automation, and Test in Europe 2002 142-149.
12. [GA98] Gupta, A., and P. Ashar.: Integrating a Boolean Satisfiability Checker and BDDs for Combinational Equivalence Checking. Proceedings 11th IEEE International Conference on VLSI Design: VLSI for Signal Processing (1998) 222-225.
13. [KZCH00] Kalla, P., Z. Zeng, M.J. Ciesielski, and C. Huang.: A BDD-based Satisfiability Infrastructure Using the Unate Recursive Paradigm. Proceedings Design, Automation, and Test in Europe 2000 232-236.
14. [KMS97] Kautz, H., D. McAllester, and B. Selman.: Exploiting Variable Dependency in Local Search. Available from http://www.cs.washington.edu/homes/ kautz/papers/dagsat.ps.
15. [Ku198] Kullmann, O. Heuristics for SAT Algorithms: Searching for Some Foundations. Submitted for publication. (Available from http://cs-svr1.swan.ac. uk/̃csoliver/heur21etter.ps.gz).
16. [LMS02] Lynce, I., and J. Marques-Silva.: Efficient Data Structures for Backtrack Search SAT Solvers. Proceedings of the Fifth International Symposium on the Theory and Applications of Satisfiability Testing (2002) 308-315. (Available from: http://gauss.ececs.uc.edu/Conferences/SAT2002/Abstracts/lynce. ps.
17. [MMZZM01] Moskewicz, M.W., C. Madigan, Y. Zhao, L. Zhang, and S. Malik.: Engineering a (Super?) Efficient SAT Solver. Proceedings of the 38th ACM/IEEE Design Automation Conference (2001).
18. [PK00] Paruthi, V., and A. Kuehlmann.: Equivalence Checking Combining a Structural SAT-Solver, BDDs, and Simulation. Proceedings of the IEEE International Conference on Computer Design: VLSI in Computers and Processors 2000, 459-464.
19. [PG96] Puri, R., J. Gu.: A BDD SAT Solver for Satisfiability Testing: An Industrial Case Study. Annals of Mathematics and Artificial Intelligence, 17 (1996) 315-337.
20. [SAFS95] Schlipf, J.S., F. Annexstein, J. Franco, and R. Swaminathan.: On finding solutions for extended Horn formulas. Information Processing Letters, 54 (1995) 133-137.
21. [Sch89] Schöning, U.: Logic for Computer Scientists. Springer Verlag (1980) 22.
22. [Sht00] Shtrichman, O.: Tuning SAT Checkers for Bounded Model Checking. Proceedings of the 12th International Computer Aided Verification Conference 2000.
23. [Sta94] Stålmarck, G.: A System for Determining Propositional Logic Theorems by Applying Values and Rules to Triplets that are Generated from a Formula. Swedish Patent No. 467,076 (approved 1992), U.S. Patent No. 5,276,897 (1994), European Patent No. 0403,454 (1995).
24. [Ve100] Velev, M.N.: Superscalar Suite 1.0. Available from: http://www.ece.cmu.edu/̃mvelev.
25. [ZMMM01] Zhang, L., C. Madigan, M. Moskewicz, and S. Malik.: Efficient Conflict Driven Learning in a Boolean Satisfiability Solver. Proceedings of ICCAD 2001.