Functional Stable Model Semantics and Answer Set Programming Modulo Theories
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.
Code (0)
등록된 구현이 없습니다.
Similar Papers 제목 키워드 기반
Answer Set Programming Modulo Theories and Reasoning about Continuous Changes
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 S…
System ASPMT2SMT:Computing ASPMT Theories by SMT Solvers
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 …
A Functional View of Strong Negation in Answer Set Programming
The distinction between strong negation and default negation has been useful in answer set programming. We present an alternative account of strong negation, which lets us view strong negation in terms of the functional …
NegationFirst-Order Stable Model Semantics with Intensional Functions
In classical logic, nonBoolean fluents, such as the location of an object, can be naturally described by functions. However, this is not the case in answer set programs, where the values of functions are pre-defined, and…
modelComparing Non-minimal Semantics for Disjunction in Answer Set Programming
In this paper, we compare four different semantics for disjunction in Answer Set Programming that, unlike stable models, do not adhere to the principle of model minimality. Two of these approaches, Cabalar and Muñiz' \em…