Solving Difficult SAT Problems by Using OBDDs and Greedy Clique Decomposition.
Yanyan XuWei ChenKaile SuWenhui ZhangPublished in: FAW-AAIM (2012)
Keyphrases
- sat problem
- np complete problems
- sat solving
- sat instances
- stochastic local search
- satisfiability problem
- solving hard
- sat solvers
- systematic search algorithms
- constraint satisfaction problems
- search algorithm
- np complete
- randomly generated
- phase transition
- temporal logic
- boolean functions
- model checking
- boolean satisfiability
- dynamic programming
- propositional satisfiability
- search space
- constraint satisfaction
- graph coloring
- evolutionary algorithm
- davis putnam