Elimination of k-Sat Clauses in the k-Satisfiability Problem.
Eric HumbertPublished in: WOCFAI (1995)
Keyphrases
- satisfiability problem
- random sat
- sat problem
- conjunctive normal form
- clause learning
- boolean satisfiability
- np complete
- temporal logic
- search algorithm
- phase transition
- sat instances
- unit propagation
- stochastic local search algorithms
- davis putnam
- cnf formula
- stochastic local search
- truth assignment
- search space
- solving hard
- max sat
- decision procedures
- boolean formula
- constraint satisfaction
- first order logic
- constraint satisfaction problems
- horn clauses
- propositional satisfiability
- randomly generated
- propositional formulas
- sat solvers
- modal logic
- special case