Considering Circuit Observability Don't Cares in CNF Satisfiability.
Zhaohui FuYinlei YuSharad MalikPublished in: DATE (2005)
Keyphrases
- cnf formula
- conjunctive normal form
- sat solving
- sat problem
- satisfiability problem
- np complete
- boolean formula
- sat instances
- high speed
- sat solvers
- phase transition
- knowledge compilation
- propositional satisfiability
- clause learning
- circuit design
- propositional logic
- boolean functions
- stochastic local search
- analog circuits
- electronic circuits
- model counting
- decision procedures
- digital circuits
- max sat
- computational complexity
- propositional formulas
- satisfiability testing
- search algorithm
- decision model
- analog vlsi
- computational properties
- frequency response
- constraint satisfaction
- constraint satisfaction problems
- delay insensitive
- quantified boolean formulas