You are in : Home » Results & submissions » Select UOA » 11 - Computer Science and Informatics » View submission: University of Huddersfield » Outputs » Detail

Output details

11 - Computer Science and Informatics

University of Huddersfield

Return to search Previous output Next output

Output 0 of 0 in the submission

Article title

Semantics and complexity of recursive aggregates in answer set programming

Type

D - Journal article

DOI

10.1016/j.artint.2010.04.002

Title of journal

Artificial Intelligence

Article number

Volume number

175

Issue number

First page of article

278

ISSN of journal

0004-3702

Year of publication

2011

URL

http://dx.doi.org/10.1016/j.artint.2010.04.002

Number of additional authors

Additional information

<22>This article introduces a new semantics for disjunctive logic programs with any kind of aggregate, overcoming the drawbacks of earlier proposals (the problem was open for about 15 years). In fact, it has become known as "FLP semantics" and has been applied to a wide class of related constructs, providing semantics for description logic programs, HEX programs, general-formula ASP etc. The article also studies the computational complexity of various reasoning tasks under the new semantics, providing formal proofs for all results. Journal article cited by 62/10/27 (Scholar/ISI/Scopus).

Interdisciplinary

Cross-referral requested

Research group

None

Citation count

Proposed double-weighted

Double-weighted statement

Reserve for a double-weighted output

Non-English

English abstract