Prime clauses for fast enumeration of satisfying assignments to Boolean circuits

Proceedings - Design Automation Conference

Volumn , Issue , 2005, Pages 750-753

  Jin, HoonSang ^a   Somenzi, Fabio ^a  

^a UNIVERSITY OF COLORADO   (United States)

Author keywords

AllSAT; CNF; Minimal satisfying assignment; SAT

Indexed keywords

ALGORITHMS; COMPUTER HARDWARE; COMPUTER SOFTWARE; PROBLEM SOLVING;

ALLSAT; CNF; SAT;

BOOLEAN ALGEBRA;

EID: 27944466840     PISSN: 0738100X     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1065579.1065775     Document Type: Conference Paper

References (10)

1. R. K. Brayton et al. VIS: A system for verification and synthesis. In CAV'96, pages 428-432. Springer-Verlag, Berlin, 1996. LNCS 1102.
2. M. Davis, G. Logemann, and D. Loveland. A machine program for theorem proving. Communications of the ACM, 5:394-397, 1962.
3. M. Davis and H. Putnam. A computing procedure for quantification theory. Journal of the ACM, 7(3):201-215, July 1960.
4. N. Eén and N. Sörensson. Temporal induction by incremental SAT solving. First Intl. Workshop on Bounded Model Checking. ENTCS, 89(4), 2003.
5. M. K. Ganai, A. Gupta, and P. Ashar. Efficient SAT-based unbounded symbolic model checking using circuit cofactoring. In ICCAD, pages 408-415, Nov. 2004.
6. H. Jin, H. Han, and F. Somenzi. Efficient conflict analysis for finding all satisfying assignments of a Boolean circuit. In TACAS'05, pages 487-300, Apr. 2005. LNCS 3440.
7. H. Jin and F. Somenzi. An incremental algorithm to check satisfiability for bounded model checking. Second Intl. Workshop on Bounded Model Checking. Boston, MA, July 2004.
8. K. L. McMillan. Applying SAT methods in unbounded symbolic model checking. In CAV'02, pages 250-264. Springer-Verlag, Berlin, July 2002. LNCS 2404.
9. K. Ravi and F. Somenzi. Minimal assignments for bounded model checking. In TACAS'04, pages 31-45, Barcelona, Spain, Mar.-Apr. 2004. LNCS 2988.
10. URL: http://vlsi.colorado.edu/~vis.