tts: A SAT-Solver for Small, Difficult Instances
Ivor T. A. Spence · Journal on Satisfiability Boolean Modeling and Computation · 2008
The Ternary Tree Solver (tts ) is a complete solver for propositional satisfiability which was designed to have good performance on the most difficult small instances. It uses a static ternary tree data structure to represent the simplified propositi