Abstract
Satisfiability checking aims to develop algorithms and tools for checking the satisfiability of existentially quantified logical formulas. Besides powerful SAT solvers for solving propositional logic formulas, sophisticated SAT-modulo-theories (SMT) solvers are available for a wide range of theories, and are applied as black-box engines for many techniques in different areas. In this paper we give a short introduction to the theoretical foundations of satisfiability checking, mention some of the most popular tools, and discuss the successful embedding of SMT solvers in different technologies.
Cite
CITATION STYLE
Ábrahám, E., & Kremer, G. (2016). Satisfiability checking: Theory and applications. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 9763, pp. 9–23). Springer Verlag. https://doi.org/10.1007/978-3-319-41591-8_2
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
