Finding Minimal Unsatisfiable Subformulae in Satisfiability Instances.
Renato BruniAntonio SassanoPublished in: CP (2000)
Keyphrases
- phase transition
- unsatisfiable cores
- boolean formula
- random sat
- satisfiability problem
- np complete
- sat solvers
- randomly generated
- sat instances
- propositional formulas
- propositional logic
- random instances
- propositional satisfiability
- computational complexity
- stochastic local search
- cnf formula
- boolean satisfiability
- maximum satisfiability
- cellular automata