SAT Modulo Monotonic Theories

@inproceedings{Bayless2015SATMM,
  title={SAT Modulo Monotonic Theories},
  author={Sam Bayless and N. Bayless and H. Hoos and A. Hu},
  booktitle={AAAI},
  year={2015}
}
Boolean satisfiability (SAT) solvers have been successfully applied to a wide variety of difficult combinatorial problems. Many further problems can be solved by SAT Modulo Theory (SMT) solvers, which extend SAT solvers to handle additional types of constraints. However, building efficient SMT solvers is often very difficult. In this paper, we define the concept of a Boolean monotonic theory and show how to easily build efficient SMT solvers, including effective theory propagation and clause… Expand
28 Citations
FourierSAT: A Fourier Expansion-Based Algebraic Framework for Solving Hybrid Boolean Constraints
  • 3
  • Highly Influenced
  • PDF
Minimal sets on propositional formulae. Problems and reductions
  • 10
SAT-to-SAT: Declarative Extension of SAT Solvers with New Propagators
  • 9
  • PDF
SMT Solving for the Theory of Ordering Constraints
  • 2
  • PDF
Solving QBF Instances with Nested SAT Solvers
  • 16
  • PDF
Answer Set Programming modulo
  • PDF
Answer Set Programming Modulo Acyclicity
  • 5
Fast, Flexible, and Minimal CTL Synthesis via SMT
  • 6
  • PDF
...
1
2
3
...

References

SHOWING 1-10 OF 46 REFERENCES
Satisfiability Modulo Theories: An Appetizer
  • 181
  • PDF
Answer Set Programming as SAT modulo Acyclicity
  • 37
  • PDF
SAT Modulo Graphs: Acyclicity
  • 33
  • PDF
An Extensible SAT-solver
  • 2,943
  • PDF
Z3: An Efficient SMT Solver
  • 5,508
  • PDF
ASP with Applications to Mazes and Levels
  • 17
Property-directed incremental invariant generation
  • 76
  • PDF
clasp : A Conflict-Driven Answer Set Solver
  • 313
  • PDF
An Incremental Algorithm for a Generalization of the Shortest-Path Problem
  • 398
  • PDF
...
1
2
3
4
5
...