# Satisfiability.jl: Satisfiability Modulo Theories in Julia

arXiv: https://arxiv.org/abs/2309.08778 · HTML: https://mlsanity.com/paper/2309.08778/

## Key facts

- Cited by 1 papers in the map (data through 14 Oct 2026).
- First posted on arXiv 15 Sep 2023.

## Built on by (most cited first, 1 of 1)

- [Learning Temporal Logic Predicates from Data with Statistical Guarantees](https://mlsanity.com/paper/2406.10449/) (2024)

## Abstract (arXiv)

Satisfiability modulo theories (SMT) is a core tool in formal verification. While the SMT-LIB specification language can be used to interact with theorem proving software, a high-level interface allows for faster and easier specifications of complex SMT formulae. In this paper we present a novel open-source package for interacting with SMT-LIB compliant solvers in the Julia programming language.