tts: A SAT-Solver for Small, Difficult Instances.
Ivor T. A. SpencePublished in: J. Satisf. Boolean Model. Comput. (2008)
Keyphrases
- sat solvers
- sat instances
- propositional satisfiability
- sat solving
- boolean formula
- boolean satisfiability
- orders of magnitude
- random sat instances
- constraint satisfaction
- search strategies
- satisfiability problem
- sat problem
- max sat
- maximum satisfiability
- stochastic local search
- computational properties
- search tree
- randomly generated
- search space
- text to speech
- phase transition
- max sat solver
- genetic algorithm
- probabilistic planning
- constraint solver
- propositional logic
- np complete
- computational complexity