Solving Propositional Satisfiability Problems.
Robert G. JeroslowJinchang WangPublished in: Ann. Math. Artif. Intell. (1990)
Keyphrases
- satisfiability problem
- solving hard
- davis putnam logemann loveland
- propositional logic
- stochastic local search
- sat instances
- finite domain
- np complete
- phase transition
- davis putnam
- search algorithm
- graph coloring problems
- temporal logic
- first order logic
- conjunctive normal form
- sat problem
- stochastic local search algorithms
- cl pc
- boolean formula
- pspace complete
- max sat
- random sat
- constraint satisfaction
- logic programs
- mazurkiewicz traces
- propositional formulas
- model checking
- combinatorial optimization