Recursive Aggregates as Intensional Functions in Answer Set Programming: Semantics and Strong Equivalence
This paper shows that the semantics of programs with aggregates implemented by the solvers clingo and dlv can be characterized as extended First-Order formulas with intensional functions in the logic of Here-and-There. Furthermore, this characterization can be used to study the strong equivalence of programs with aggregates under either semantics. We also present a transformation that reduces the task of checking strong equivalence to reasoning in classical First-Order logic, which serves as a foundation for automating this procedure.
Code (0)
등록된 구현이 없습니다.
Similar Papers 제목 키워드 기반
Functional ASP with Intensional Sets: Application to Gelfond-Zhang Aggregates
In this paper, we propose a variant of Answer Set Programming (ASP) with evaluable functions that extends their application to sets of objects, something that allows a fully logical treatment of aggregates. Formally, we …
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…
Rewriting recursive aggregates in answer set programming: back to monotonicity
Aggregation functions are widely used in answer set programming for representing and reasoning on knowledge involving sets of objects collectively. Current implementations simplify the structure of programs in order to o…
TranslationFirst-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…
modelA 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 …
Negation