Satisfiability Modulo Theories: A Beginner’s Tutorial Article Swipe

View

Related Concepts

Computer science Modulo Satisfiability Programming language Theoretical computer science Satisfiability modulo theories Algorithm Algebra over a field Calculus (dental) Discrete mathematics Mathematics Dentistry Pure mathematics Medicine

Clark Barrett , Cesare Tinelli , Haniel Barbosa , Aina Niemetz , Mathias Preiner , Andrew Reynolds , Yoni Zohar ·

YOU? · · 2024 · Open Access · · DOI: https://doi.org/10.1007/978-3-031-71177-0_31 · OA: W4402496111

Great minds have long dreamed of creating machines that can function as general-purpose problem solvers. Satisfiability modulo theories (SMT) has emerged as one pragmatic realization of this dream, providing significant expressive power and automation. This tutorial is a beginner’s guide to SMT. It includes an overview of SMT and its formal foundations, a catalog of the main theories used in SMT solvers, and illustrations of how to obtain models and proofs. Throughout the tutorial, examples and exercises are provided as hands-on activities for the reader. They can be run using either Python or the SMT-LIB language, using either the cvc5 or the Z3 SMT solver.