Dynamic detection and removal of inactive clauses in SAT with application in image computation

Proceedings - Design Automation Conference

Volumn , Issue , 2001, Pages 536-541

  Gupta, Aarti ^a   Gupta, Anubhav ^b   Yang, Zijiang ^a   Ashar, Pranav ^a  

^a NEC LABORATORIES AMERICA   (United States)

^b Carnegie Mellon University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; APPLICATION SPECIFIC INTEGRATED CIRCUITS; COMBINATORIAL CIRCUITS; COMPUTATIONAL METHODS; HEURISTIC METHODS; IMAGE COMPRESSION; PROBLEM SOLVING; SOFTWARE PROTOTYPING; VLSI CIRCUITS;

BOOLEAN SATISFIABILITY (SAT) PROBLEMS;

COMPUTER AIDED DESIGN;

EID: 0034841433     PISSN: 0738100X     EISSN: None     Source Type: Journal    
DOI: 10.1109/DAC.2001.156197     Document Type: Article

References (22)

1. Digital systems testing and testable design
2. Symbolic model checking without BDDs
3. VIS: A system for verification and synthesis
4. Graph-based algorithms for Boolean function manipulation
5. Tight integration of combinational verification methods
6. Symbolic model checking for sequential circuit verification
7. A transitive closure algorithm for test generation
8. Verifying temporal properties of sequential machines without building their state diagrams
9. Integrating a Boolean satisfiability checker and BDDs for combinational verification
10. Sat-based image computation with application in reachability analysis
11. Recursive learning: A new implication technique for efficient solutions to CAD problems - Test, verification and optimization
12. Test pattern generation using Boolean satisfiability
13. Improving satisfiability algorithms with dominance and partitioning
14. Grasp: A new search algorithm for satisfiability
15. Border-block triangular form and conjunction schedule in image computation
16. To split or to conjoin: The question in image computation
17. Engineering a (super?) efficient SAT solver
18. A tutorial on Stalmark's method of propositional proof
19. Tuning SAT checkers for bounded model checking
20. SATO: An efficient propositional prover