Eliminating Redundant Clauses in SAT Instances.
Olivier FourdrinoyÉric GrégoireBertrand MazureLakhdar SaisPublished in: CPAIOR (2007)
Keyphrases
- eliminating redundant
- sat instances
- random sat instances
- boolean satisfiability
- sat solvers
- random sat
- boolean formula
- sat problem
- satisfiability problem
- clause learning
- conjunctive normal form
- randomly generated
- computational properties
- phase transition
- stochastic local search
- first order logic
- search space
- cnf formula
- propositional satisfiability
- expressive power
- propositional formulas
- np complete
- orders of magnitude
- constraint satisfaction
- search algorithm
- branch and bound algorithm
- max sat
- random instances
- probabilistic planning
- description logics
- upper bound
- lower bound