Amanote Research
Register
Sign In
Tts: A SAT-Solver for Small, Difficult Instances
Journal on Satisfiability, Boolean Modeling and Computation
doi 10.3233/sat190043
Full Text
Open PDF
Abstract
Available in
full text
Date
June 1, 2008
Authors
Ivor Spence
Publisher
IOS Press
Related search
DSatz: A Directional SAT Solver for Planning
Versat: A Verified Modern SAT Solver
Lecture Notes in Computer Science
Computer Science
Theoretical Computer Science
A Max-Sat Solver With Lazy Data Structures
Lecture Notes in Computer Science
Computer Science
Theoretical Computer Science
MiniMaxSAT: An Efficient Weighted Max-Sat Solver
Journal of Artificial Intelligence Research
Artificial Intelligence
A Verified SAT Solver Framework With Learn, Forget, Restart, and Incrementality
Lecture Notes in Computer Science
Computer Science
Theoretical Computer Science
Unsatisfiability Proofs for Parallel SAT Solver Portfolios With Clause Sharing and Inprocessing
Improving SAT Solver Performance With Structure-Based Preferential Bumping
Small Random Instances of the Stable Roommates Problem
Journal of Statistical Mechanics: Theory and Experiment
Nonlinear Physics
Uncertainty
Statistics
Probability
Statistical
An Improved Deterministic #SAT Algorithm for Small De Morgan Formulas
Lecture Notes in Computer Science
Computer Science
Theoretical Computer Science