All-SAT Using Minimal Blocking Clauses.
Yinlei YuPramod SubramanyanNestan TsiskaridzeSharad MalikPublished in: VLSI Design (2014)
Keyphrases
- unsatisfiable cores
- boolean satisfiability
- max sat
- sat solvers
- boolean formula
- propositional formulas
- satisfiability problem
- sat problem
- sat solving
- first order logic
- maximum satisfiability
- clause learning
- cnf formula
- random sat instances
- conjunctive normal form
- propositional satisfiability
- phase transition
- lower bound
- branch and bound
- prime implicates
- random sat
- unit propagation
- symmetry breaking
- stochastic local search algorithms
- sat instances
- background knowledge
- tabu search
- logic programming