System ASPMT2SMT: computing ASPMT theories by SMT solvers. 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 aspsmt2smt, which implements this translation. The system uses ASP grounder gringo and SMT solver z3. gringo partially grounds input programs while leaving some variables to be processed by z3. We demonstrate that the system can effectively handle real number computations for reasoning about continuous changes.
Keywords for this software
References in zbMATH (referenced in 4 articles , 1 standard article )
Showing results 1 to 4 of 4.
- Bartholomew, Michael; Lee, Joohyung: First-order stable model semantics with intensional functions (2019)
- Cuteri, Bernardo; Dodaro, Carmine; Ricca, Francesco; Schüller, Peter: Partial compilation of ASP programs (2019)
- Wałęga, Przemysław Andrzej; Schultz, Carl; Bhatt, Mehul: Non-monotonic spatial reasoning with answer set programming modulo theories (2017)
- Bartholomew, Michael; Lee, Joohyung: System \textscaspmt2smt: computing ASPMT theories by SMT solvers (2014)