Search pruning techniques in SAT-based branch-and-bound algorithms for the binate covering problem

IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems

Volumn 21, Issue 5, 2002, Pages 505-516

  Manquinho, Vasco M ^a   Marques Silva, João P ^a,b  

^a INSTITUTO SUPERIOR TÉCNICO   (Portugal)

^b Cadence Laboratories / INESC ID   (Portugal)

Author keywords

Backtrack search; Binate covering problem; Branch and bound; Nonchronological backtracking; Propositional satisfiability

Indexed keywords

BINATE COVERING PROBLEM; BOOLEAN SATISFIABILITY DOMAIN; BRANCH-AND-BOUND ALGORITHMS; CONJUNCTIVE NORMAL FORM; SEARCH PRUNING TECHNIQUES;

BOOLEAN FUNCTIONS; BOUNDARY CONDITIONS; COMPUTATIONAL COMPLEXITY; HEURISTIC METHODS; MATRIX ALGEBRA; RESPONSE TIME (COMPUTER SYSTEMS);

ALGORITHMS;

EID: 0036576020     PISSN: 02780070     EISSN: None     Source Type: Journal    
DOI: 10.1109/43.998623     Document Type: Article

References (18)

1. A Davis-Putnam enumeration algorithm for linear pseudo-boolean optimization
2. Using CSP look-back techniques to solve real-world SAT instances
3. Two-level logic minimization, An overview
4. On solving covering problems
5. New ideas for solving covering problems
6. A computing procedure for quantification theory
7. An exact solution to the minimum-size test pattern problem
8. A reduction technique for prime implicant tables
9. Negative thinking by incremental problem solving: Application to unate covering
10. Solving covering problems using LPR-based lower bounds
11. Prime implicant computation using satisfiability algorithms
12. GRASP: A new search algorithm for satisfiability
13. Explicit and implicit algorithms for binate covering problems
14. Logic synthesis and optimization benchmarks user guide
15. SATO: An efficient propositional prover