Satisfiability.jl: Satisfiability Modulo Theories in Julia

This is an archived version of Satisfiability.jl, a package for representing satisfiability modulo theories (SMT) problems in Julia. This package provides a simple front-end interface to common SMT solvers, including full support for vector-valued and matrix-valued expressions. Currently, the theories of propositional logic, uninterpreted functions, Integers, Reals and fixed-size BitVectors are supported. Satisfiability.jl is not a solver; it is a tool to simplify interaction with solvers that implement the SMT-LIB specification language.