Answer Set Programming Modulo Theories and Reasoning about Continuous Changes
Proceedings of the Twenty-Third International Joint Conference on Artificial Intelligence. Pages 990-995.
Abstract
Answer Set Programming Modulo Theories (ASPMT) is a new framework of tight integration of answer set programming (ASP) and satisfiability modulo theories (SMT). Similar to the relationship between first-order logic and SMT, it is based on a recent proposal of the functional stable model semantics by fixing interpretations of background theories. Analogously to a known relationship between ASP and SAT, tight ASPMT programs can be translated into SMT instances. We demonstrate the usefulness of ASPMT by enhancing action language C+ to handle continuous changes as well as discrete changes. We reformulate the semantics of C+ in terms of ASPMT, and show that SMT solvers can be used to compute the language. We also show how the language can represent cumulative effects on continuous resources.
@inproceedings{ijcai2013p151,
title = {Answer Set Programming Modulo Theories and Reasoning about Continuous Changes},
author = {Lee, Joohyung and Meng, Yunsong},
booktitle = {Proceedings of the Twenty-Third International Joint Conference on
Artificial Intelligence, {IJCAI-13}},
publisher = {AAAI Press / International Joint Conferences on Artificial Intelligence},
editor = {Francesca Rossi},
pages = {990--995},
year = {2013},
month = {8},
url = {https://ijcai.org/proceedings/2013/151},
}
TY - CPAPER TI - Answer Set Programming Modulo Theories and Reasoning about Continuous Changes AU - Lee, Joohyung AU - Meng, Yunsong T2 - Proceedings of the Twenty-Third International Joint Conference on Artificial Intelligence, IJCAI-13 PB - AAAI Press / International Joint Conferences on Artificial Intelligence PY - 2013 SP - 990 EP - 995 UR - https://ijcai.org/proceedings/2013/151 ER -Copied
Machine-readable versions of this paper, for tools and AI agents:
