Functional Stable Model Semantics and Answer Set Programming Modulo Theories
Proceedings of the Twenty-Third International Joint Conference on Artificial Intelligence. Pages 718-723.
Abstract
Recently there has been an increasing interest in incorporating intensional functions in answer set programming. Intensional functions are those whose values can be described by other functions and predicates, rather than being pre-defined as in the standard answer set programming. We demonstrate that the functional stable model semantics plays an important role in the framework of Answer Set Programming Modulo Theories (ASPMT) — a tight integration of answer set programming and satisfiability modulo theories, under which existing integration approaches can be viewed as special cases where the role of functions is limited. We show that tight ASPMT programs can be translated into SMT instances, which is similar to the known relationship between ASP and SAT.
@inproceedings{ijcai2013p113,
title = {Functional Stable Model Semantics and Answer Set Programming Modulo Theories},
author = {Bartholomew, Michael and Lee, Joohyung},
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 = {718--723},
year = {2013},
month = {8},
url = {https://ijcai.org/proceedings/2013/113},
}
TY - CPAPER TI - Functional Stable Model Semantics and Answer Set Programming Modulo Theories AU - Bartholomew, Michael AU - Lee, Joohyung 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 - 718 EP - 723 UR - https://ijcai.org/proceedings/2013/113 ER -Copied
Machine-readable versions of this paper, for tools and AI agents:
