Satometer: How much have we searched?

Proceedings - Design Automation Conference

Volumn , Issue , 2002, Pages 737-742

  Aloul, Fadi A ^a   Sierawski, Brian D ^a   Sakallah, Karem A ^a  

^a University of Michigan   (United States)

Author keywords

Backtrack search; BDDs; CNF; Conflict diagnosis; SAT; Search progress; Search space coverage; ZBDDs

Indexed keywords

SATOMETERS;

ALGORITHMS; BOOLEAN FUNCTIONS; COMPUTATION THEORY; DATA STRUCTURES;

PROBLEM SOLVING;

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

References (19)

1. Backtrack search using ZBDDs
2. An experimental study of satisfiability search heuristics
3. Using CSP look-back techniques to solve real world SAT instances
4. Symbolic model checking using SAT procedures instead of BDDs
5. Graph-based algorithms for boolean function manipulation
6. Multi-resolution on compressed sets of clauses
7. Symmetry-breaking predicates for search problems
8. A machine program for theorem proving
9. The theory of zero-suppressed BDDs and the number of Knight’s tours
10. Algebraic simplification techniques for propositional satisfiability
11. GRASP: A search algorithm for propositional satisfiability
12. Zero-suppressed BDDs for set manipulation in combinatorial problems
13. Chaff: Engineering an efficient SAT solver
14. A comparative study of two boolean formulations of FPGA detailed routing constraints
15. Boolean satisfiability with transitivity constraints
16. SATO: An efficient propositional prover