On optimizing the satisfiability (SAT) problem.
Jun GuQian-Ping GuDing-Zhu DuPublished in: J. Comput. Sci. Technol. (1999)
Keyphrases
- sat problem
- satisfiability problem
- np complete
- phase transition
- sat solvers
- constraint satisfaction problems
- sat instances
- randomly generated
- davis putnam
- boolean satisfiability
- random sat instances
- max sat
- propositional satisfiability
- decision problems
- sat solving
- random sat
- stochastic local search
- temporal logic
- cnf formula
- search algorithm
- boolean formula
- propositional formulas
- branch and bound
- constraint satisfaction
- orders of magnitude
- lower bound
- information retrieval
- propositional logic
- evolutionary algorithm