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 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.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Gebser, M., Ostrowski, M., Schaub, T.: Constraint answer set solving. In: Hill, P.M., Warren, D.S. (eds.) ICLP 2009. LNCS, vol. 5649, pp. 235–249. Springer, Heidelberg (2009)
Balduccini, M.: Representing constraint satisfaction problems in answer set programming. In: Working Notes of the Workshop on Answer Set Programming and Other Computing Paradigms, ASPOCP (2009)
Janhunen, T., Liu, G., Niemelä, I.: Tight integration of non-ground answer set programming and satisfiability modulo theories. In: Working notes of the 1st Workshop on Grounding and Transformations for Theories with Variables (2011)
Bartholomew, M., Lee, J.: Functional stable model semantics and answer set programming modulo theories. In: Proceedings of International Joint Conference on Artificial Intelligence, IJCAI (2013)
Bartholomew, M., Lee, J.: Stable models of formulas with intensional functions. In: Proceedings of International Conference on Principles of Knowledge Representation and Reasoning (KR), pp. 2–12 (2012)
Ferraris, P., Lee, J., Lifschitz, V.: Stable models and circumscription. Artificial Intelligence 175, 236–263 (2011)
Barrett, C.W., Sebastiani, R., Seshia, S.A., Tinelli, C.: Satisfiability modulo theories. In: Biere, A., Heule, M., van Maaren, H., Walsh, T. (eds.) Handbook of Satisfiability. Frontiers in Artificial Intelligence and Applications, vol. 185, pp. 825–885. IOS Press (2009)
Babb, J., Lee, J.: Cplus2ASP: Computing action language \(\cal C\)+ in answer set programming. In: Cabalar, P., Son, T.C. (eds.) LPNMR 2013. LNCS, vol. 8148, pp. 122–134. Springer, Heidelberg (2013)
Lee, J., Palla, R.: System f2lp – computing answer sets of first-order formulas. In: Erdem, E., Lin, F., Schaub, T. (eds.) LPNMR 2009. LNCS, vol. 5753, pp. 515–521. Springer, Heidelberg (2009)
Lee, J., Lifschitz, V.: Describing additive fluents in action language \(\cal C\)+. In: Proceedings of International Joint Conference on Artificial Intelligence (IJCAI), pp. 1079–1084 (2003)
Chintabathina, S.: Towards answer set prolog based architectures for intelligent agents. In: AAAI 2008, pp. 1843–1844 (2008)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2014 Springer International Publishing Switzerland
About this paper
Cite this paper
Bartholomew, M., Lee, J. (2014). System aspmt2smt: Computing ASPMT Theories by SMT Solvers. In: Fermé, E., Leite, J. (eds) Logics in Artificial Intelligence. JELIA 2014. Lecture Notes in Computer Science(), vol 8761. Springer, Cham. https://doi.org/10.1007/978-3-319-11558-0_37
Download citation
DOI: https://doi.org/10.1007/978-3-319-11558-0_37
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-11557-3
Online ISBN: 978-3-319-11558-0
eBook Packages: Computer ScienceComputer Science (R0)