ScholarLens Back to search
2010•Artificial IntelligenceOpen access

Semantics and complexity of recursive aggregates in answer set programming

Wolfgang Faber, Gerald Pfeifer, Nicola Leone

Open full text 240 citations

Abstract

This record does not include an abstract. Use the full-text link above if available.

Open-access reader

About this research paper

What this paper is about

An abstract is not available in the OpenAlex record for this paper.

Why it matters

OpenAlex reports 240 citations for this work. Citation counts describe recorded attention and do not establish research quality.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Key concepts: Stable model semantics, Answer set programming, Recursion (computer science), Semantics (computer science), Well-founded semantics, Set (abstract data type), Generalization, Theoretical computer science

Related papers

Related paper 1Related paper 2Related paper 3
Back to paper searchBrowse research topicsOriginal source
Semantics and complexity of recursive aggregates in answer set programming — Research Paper | ScholarLens