Functional ASP with intensional sets: application to Gelfond-Zhang aggregates
From MaRDI portal
(Redirected from Publication:4559801)
Abstract: 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 start from the syntax of First Order Logic with equality and the semantics of Quantified Equilibrium Logic with evaluable functions (QELF). Then, we proceed to incorporate a new kind of logical term, intensional set (a construct commonly used to denote the set of objects characterised by a given formula), and to extend QELF semantics for this new type of expression. In our extended approach, intensional sets can be arbitrarily used as predicate or function arguments or even nested inside other intensional sets, just as regular first-order logical terms. As a result, aggregates can be naturally formed by the application of some evaluable function (count, sum, maximum, etc) to a set of objects expressed as an intensional set. This approach has several advantages. First, while other semantics for aggregates depend on some syntactic transformation (either via a reduct or a formula translation), the QELF interpretation treats them as regular evaluable functions, providing a compositional semantics and avoiding any kind of syntactic restriction. Second, aggregates can be explicitly defined now within the logical language by the simple addition of formulas that fix their meaning in terms of multiple applications of some (commutative and associative) binary operation. For instance, we can use recursive rules to define sum in terms of integer addition. Last, but not least, we prove that the semantics we obtain for aggregates coincides with the one defined by Gelfond and Zhang for the Alog language, when we restrict to that syntactic fragment. (Under consideration for acceptance in TPLP)
Recommendations
Cites work
- A Constructive semantic characterization of aggregates in answer set programming
- ASP with non-herbrand partial functions: a language and system for practical use
- Extending and implementing the stable model semantics
- Functional answer set programming
- Gelfond-Zhang aggregates as propositional formulas
- Knowledge Representation, Reasoning and Declarative Problem Solving
- Logic Programming
- Logic programming and nonmonotonic reasoning. 10th international conference, LPNMR 2009, Potsdam, Germany, September 14--18, 2009. Proceedings
- Logic programming with sets
- Logic programs with propositional connectives and aggregates
- Program completion in the input language of GRINGO
- Semantics and complexity of recursive aggregates in answer set programming
- Set constructors in a logic database language
- Vicious circle principle and logic programs with aggregates
- Well-founded and stable semantics of logic programs with aggregates
Cited in
(10)- Autoepistemic answer set programming
- Recursive rules with aggregation: a simple unified semantics
- First-order stable model semantics with intensional functions
- Vicious circle principle, aggregates, and formation of sets in ASP based languages
- Automated reasoning with restricted intensional sets
- Functional answer set programming
- Gelfond-Zhang aggregates as propositional formulas
- Gelfond-Zhang aggregates as propositional formulas
- Deontic equilibrium logic with explicit negation
- On aggregation functions based on linguistically quantified propositions and finitely additive set functions
This page was built for publication: Functional ASP with intensional sets: application to Gelfond-Zhang aggregates
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4559801)
