tts: a SAT-solver for small, difficult instances The Ternary Tree Solver (tts) is a complete solver for propositional satisfiability
Keywords for this software
References in zbMATH (referenced in 3 articles , 1 standard article )
Showing results 1 to 3 of 3.
- Van Gelder, Allen: Producing and verifying extremely large propositional refutations (2012)
- Van Gelder, Allen; Spence, Ivor: Zero-one designs produce small hard SAT instances (2010)
- Spence, Ivor: tts: a SAT-solver for small, difficult instances (2008)