Semantics and complexity of recursive aggregates in answer set programming
type: Item
instance of: scholarly article
title: Semantics and complexity of recursive aggregates in answer set programming
zbMATH Open document ID: 1216.68263
author: Wolfgang Faber
author: Gerald Pfeifer
author: N. Leone
published in: Artificial Intelligence
publication date: 2011-06-17T00:00:00Z
full work available at URL: aggr final.pdf
Mathematics Subject Classification ID: 68T27
Mathematics Subject Classification ID: 68N17
Mathematics Subject Classification ID: 68Q25
zbMATH DE Number: 5909444
zbMATH Keywords: nonmonotonic reasoning
zbMATH Keywords: answer set programming
zbMATH Keywords: aggregates
zbMATH Keywords: computational complexity
describes a project that uses: NoMoRe
describes a project that uses: Datalog
describes a project that uses: ASSAT
describes a project that uses: Cmodels
describes a project that uses: nomore++
MaRDI profile type: Publication
OpenAlex ID: W2064864283
cites work: Logics in Artificial Intelligence
cites work: Q5633670
cites work: Circumscription - a form of non-monotonic reasoning
cites work: A logic for default reasoning
cites work: Non-monotonic logic. I
cites work: Nonmonotonic Logic II
cites work: Semantical considerations on nonmonotonic logic
cites work: Q3983043
cites work: Knowledge Representation, Reasoning and Declarative Problem Solving
cites work: Q3939270
cites work: Extending and implementing the stable model semantics
cites work: Unfolding partiality and disjunctions in stable model semantics
cites work: The DLV system for knowledge representation and reasoning
cites work: ASSAT: computing answer sets of a logic program by SAT solvers
cites work: Logic Programming and Nonmonotonic Reasoning
cites work: Q4798024
cites work: The nomore + + Approach to Answer Set Solving
cites work: Monotonic aggregation in deductive databases
cites work: Q4707773
cites work: Well-founded and stable semantics of logic programs with aggregates
cites work: A Constructive semantic characterization of aggregates in answer set programming
cites work: Q3348437
cites work: Logic programming and nonmonotonic reasoning. 5th international conference, LPNMR '99. El Paso, TX, USA, December 2--4, 1999. Proceedings
cites work: Succinctness as a source of complexity in logical formalisms
cites work: Q4131648
cites work: Autoepistemic logic
cites work: On the computational cost of disjunctive logic programming: Propositional case
cites work: Weight constraints as nested expressions
cites work: Nested expressions in logic programs
cites work: Q3624081
DOI: 10.1016/J.ARTINT.2010.04.002
description: scientific article; zbMATH DE number 5909444