3 papers
cs.LO2024
DRAT Proofs of Unsatisfiability for SAT Modulo Monotonic Theories
Nick Feng, Alan J. Hu, Sam Bayless +5
Generating proofs of unsatisfiability is a valuable capability of most SAT solvers, and is an active area of research for SMT solvers. This paper introduces the first method to eff…
cs.AI2015
The Configurable SAT Solver Challenge (CSSC)
Frank Hutter, Marius Lindauer, Adrian Balint +3
It is well known that different solution strategies work well for different types of instances of hard combinatorial problems. As a consequence, most solvers for the propositional…
cs.LO2014
SAT Modulo Monotonic Theories
Sam Bayless, Noah Bayless, Holger H. Hoos +1
We define the concept of a monotonic theory and show how to build efficient SMT (SAT Modulo Theory) solvers, including effective theory propagation and clause learning, for such th…