SAT Modulo Monotonic Theories

  title={SAT Modulo Monotonic Theories},
  author={Sam Bayless and Noah Bayless and Holger H. Hoos and Alan J. Hu},
Satisfiability Modulo Theories (SMT) solvers are a class of efficient constraint solvers which form integral parts of many algorithms. Over the years, dozens of different Satisfiability Modulo Theories solvers have been developed, supporting dozens of different logics. However, there are still many important applications for which specialized SMT solvers have not yet been developed. We develop a framework for easily building efficient SMT solvers for previously unsupported logics. Our… CONTINUE READING
Highly Cited
This paper has 17 citations. REVIEW CITATIONS


Publications citing this paper.
Showing 1-10 of 11 extracted citations


Publications referenced by this paper.
Showing 1-10 of 28 references

The Warzone map tools: Diorama

F. Schanda, M. Brain
View 6 Excerpts
Highly Influenced

Z3: An Efficient SMT Solver

View 3 Excerpts
Highly Influenced

An Extensible SAT-solver

View 2 Excerpts
Highly Influenced

ASP with applications to mazes and levels

M. J. Nelson, A. M. Smith
Shaker, N.; Togelius, J.; and Nelson, M. J., eds., Procedural Content Generation in Games: A Textbook and an Overview of Current Research. Springer. • 2014
View 2 Excerpts

SAT modulo monotonic theories

S. Bayless, N. Bayless, H. H. Hoos, A. J. Hu
arXiv preprint arXiv:1406.0043. • 2014
View 1 Excerpt

Similar Papers

Loading similar papers…