Solving the resolution-free SAT problem by submodel propagation in linear time.
Gábor KusperPublished in: Ann. Math. Artif. Intell. (2005)
Keyphrases
- sat problem
- np complete problems
- sat instances
- weighted max sat
- sat solving
- random sat instances
- solving hard
- satisfiability problem
- sat solvers
- stochastic local search
- clause learning
- phase transition
- np complete
- max sat
- boolean satisfiability
- constraint satisfaction problems
- randomly generated
- graph coloring
- propositional satisfiability
- combinatorial optimization
- random sat
- constraint propagation
- np hard
- davis putnam
- unit propagation
- optimization problems