Sub-SAT: A formulation for relaxed Boolean satisfiability with applications in routing

Proceedings of the International Symposium on Physical Design

Volumn , Issue , 2002, Pages 182-187

  Xu, Hui ^a   Rutenbar, Rob A ^a   Sakallah, Karem ^a  

^a CARNEGIE MELLON UNIVERSITY   (United States)

Author keywords

Algorithms

Indexed keywords

COMPUTER AIDED DESIGN; CONSTRAINT THEORY; MATHEMATICAL TRANSFORMATIONS; PROBLEM SOLVING; ROUTERS;

BOOLEAN SATISFIABILITY;

BOOLEAN ALGEBRA;

EID: 0036375785     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (27)

1. Symbolic boolean manipulation with ordered binary-decision diagrams
2. Efficient implementation of a BDD package
3. Dynamic variable ordering for binary decision diagrams
4. Zero-suppressed BDDs for set manipulation in combinatorial problems
5. Algebraic decision diagrams and their applications
6. Differential BDDs
7. Binary decision diagrams and beyond: Enabling technologies for formal verification
8. A performance study of BDD-based model checking
9. Local search strategies for satisfiability testing
10. SATO: An efficient propositional prover
11. GRASP: A search algorithm for propositional satisfiability
12. Algorithms for satisfiability in combinational circuits based on backtrack search and recursive learning
13. Chaff: Engineering an efficient SAT solver
14. Effective use of boolean satisfiability procedures in the formal verification of superscalar and VLIW microprocessors
15. Optimal layout via boolean satisfiability
16. FPGA routing and routability estimation via boolean satisfiability
17. Exact switchbox routing with search space reduction
18. An exact algorithm for difficult detailed routing problems
19. Satisfiability-based layout revisited: Routing complex FPGAs via search-based boolean SAT
20. A comparative study of two boolean formulations of FPGA detailed routing constraints
21. A boolean satisfiability-based incremental rerouting approach with application to FPGAs
22. Algorithms for the maximum satisfiability problem
23. Local search algorithms for partial MAXSAT
24. Resolution and the integrality of satisfiability problems