System ASPMT2SMT:Computing ASPMT Theories by SMT Solvers

TL;DR

This paper introduces ASPMT2SMT, a system that translates ASPMT programs into SMT instances, enabling SMT solvers to compute stable models, thus enhancing reasoning capabilities for continuous change scenarios.

Contribution

It presents a novel compiler that converts ASPMT programs into SMT problems, integrating existing tools to improve reasoning over real numbers and continuous changes.

Findings

Effective handling of real number computations.

Successful translation of ASPMT to SMT for stable model computation.

Integration of gringo and z3 for practical reasoning tasks.

Abstract

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.