System aspmt2smt: Computing ASPMT Theories by SMT Solvers

@inproceedings{Bartholomew2014SystemAC,
  title={System aspmt2smt: Computing ASPMT Theories by SMT Solvers},
  author={Michael Bartholomew and Joohyung Lee},
  booktitle={JELIA},
  year={2014}
}
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… CONTINUE READING
Highly Cited
This paper has 18 citations. REVIEW CITATIONS

Similar Papers

Loading similar papers…