Solving the Satisfiability Problem by Using Randomized Approach.
L. C. WuC. Y. TangPublished in: Inf. Process. Lett. (1992)
Keyphrases
- satisfiability problem
- solving hard
- stochastic local search
- sat instances
- np complete
- temporal logic
- search algorithm
- weighted max sat
- finite domain
- graph coloring problems
- phase transition
- systematic search algorithms
- davis putnam logemann loveland
- sat problem
- stochastic local search algorithms
- pspace complete
- combinatorial optimization
- mazurkiewicz traces
- max sat
- constraint satisfaction problems
- dynamic programming