Generalized cofactors and decomposition of Boolean satisfiability problems.
Madhav DesaiVirendra SulePublished in: CoRR (2014)
Keyphrases
- satisfiability problem
- conjunctive normal form
- np complete
- temporal logic
- davis putnam logemann loveland
- search algorithm
- phase transition
- sat problem
- solving hard
- stochastic local search
- stochastic local search algorithms
- davis putnam
- finite domain
- max sat
- mazurkiewicz traces
- boolean functions
- sat instances
- pspace complete
- combinatorial problems
- constraint satisfaction problems
- special case