Solving #SAT using vertex covers.
Naomi NishimuraPrabhakar RagdeStefan SzeiderPublished in: Acta Informatica (2007)
Keyphrases
- stochastic local search
- np complete problems
- sat encodings
- search algorithm
- boolean optimization
- sat solving
- variable ordering
- sat solvers
- sat instances
- weighted max sat
- satisfiability problem
- search strategies
- boolean satisfiability
- solving hard
- exact solution
- timetabling problem
- directed graph
- combinatorial optimization
- heuristic search
- np complete
- neural network