Comparing CSP and SAT Solvers for Polynomial Constraints in Termination Provers.
Salvador LucasRafael Navarro-MarsetPublished in: Electron. Notes Theor. Comput. Sci. (2008)
Keyphrases
- sat solvers
- sat encodings
- constraint satisfaction
- constraint satisfaction problems
- constraint programming
- sat problem
- propositional satisfiability
- sat solving
- constraint solving
- clause learning
- backtrack search
- search strategies
- combinatorial problems
- max sat
- constraint propagation
- boolean satisfiability
- arc consistency
- orders of magnitude
- sat instances
- symmetry breaking
- search space
- evolutionary algorithm
- probabilistic reasoning
- heuristic search
- np hard
- genetic algorithm