Functional stable model semantics and answer set programming modulo theories

Authors:
Michael Bartholomew;Joohyung Lee
Affiliations:
School of Computing, Informatics and Decision Systems Engineering, Arizona State University, Tempe;School of Computing, Informatics and Decision Systems Engineering, Arizona State University, Tempe
Venue:
IJCAI'13 Proceedings of the Twenty-Third international joint conference on Artificial Intelligence
Year:
2013

Citing 5
Cited 0

Constraint Answer Set Solving

ICLP '09 Proceedings of the 25th International Conference on Logic Programming
Stable models and circumscription

Artificial Intelligence
Functional answer set programming

Theory and Practice of Logic Programming
A "conservative" approach to extending answer set programming with non-herbrand functions

Correct Reasoning
Connecting first-order ASP and the logic FO(ID) through reducts

Correct Reasoning

Quantified Score

Hi-index	0.00

Visualization

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.