Selection of search strategies for solving 3-SAT problems.
Andrzej PulkaPublished in: Int. J. Appl. Math. Comput. Sci. (2014)
Keyphrases
- search strategies
- sat solvers
- sat problem
- sat instances
- sat solving
- solving hard
- np complete problems
- search problems
- selection strategies
- search strategy
- propositional satisfiability
- branch and bound
- constraint satisfaction problems
- stochastic local search
- constraint programming
- satisfiability problem
- max sat
- search algorithm
- boolean satisfiability
- boolean formula
- search methods
- phase transition
- combinatorial optimization
- np complete
- evolutionary algorithm
- retrieval effectiveness
- constraint satisfaction
- heuristic search
- lower bound
- clause learning
- branch and bound algorithm
- multi objective
- randomly generated
- machine learning
- cellular automata
- query expansion
- upper bound
- random sat