Counting Satisfying Assignments in 2-SAT and 3-SAT.
Vilhelm DahllöfPeter JonssonMagnus WahlströmPublished in: COCOON (2002)
Keyphrases
- satisfiability problem
- sat solvers
- sat problem
- sat solving
- boolean satisfiability
- search algorithm
- model counting
- phase transition
- propositional satisfiability
- np complete
- stochastic local search algorithms
- randomly generated
- sat instances
- stochastic local search
- modulo theories
- backtracking search
- search tree
- search strategies
- upper bound