Answer Set Programming Modulo Theories (ASPMT) is an approach to combining answer set programming and satisfiability modulo theories based on the functional stable model semantics. It is shown that the tight fragment of ASPMT programs can be turned into SMT instances, thereby allowing SMT solvers to compute stable models of ASPMT programs. In this paper we present a compiler called {\sc aspsmt2smt}, which implements this translation. The system uses ASP grounder {\sc gringo} and SMT solver {\sc z3}. {\sc gringo} partially grounds input programs while leaving some variables to be processed by {\sc z3}. We demonstrate that the system can effectively handle real number computations for reasoning about continuous changes.
View on arXiv@article{bartholomew2025_2506.10708,
title={ System ASPMT2SMT:Computing ASPMT Theories by SMT Solvers },
author={ Michael Bartholomew and Joohyung Lee },
journal={arXiv preprint arXiv:2506.10708},
year={ 2025 }
}