Rewriting recursive aggregates in answer set programming : Back to monotonicity
- Submitting institution
-
The University of Huddersfield
- Unit of assessment
- 11 - Computer Science and Informatics
- Output identifier
- 59
- Type
- D - Journal article
- DOI
-
10.1017/S1471068415000228
- Title of journal
- Theory and Practice of Logic Programming
- Article number
- -
- First page
- 559
- Volume
- 15
- Issue
- 4-5
- ISSN
- 1471-0684
- Open access status
- Out of scope for open access requirements
- Month of publication
- September
- Year of publication
- 2015
- URL
-
-
- Supplementary information
-
-
- Request cross-referral to
- -
- Output has been delayed by COVID-19
- No
- COVID-19 affected output statement
- -
- Forensic science
- No
- Criminology
- No
- Interdisciplinary
- No
- Number of additional authors
-
2
- Research group(s)
-
-
- Citation count
- 15
- Proposed double-weighted
- No
- Reserve for an output with double weighting
- No
- Additional information
- Published in TPLP, A-ranked in ARC2010 and Scimago-ranked Q1 in software, this output has had significant impact because it describes the first practical method for dealing with arbitrary recursive aggregates in Answer Set Programming. This method was subsequently implemented in clingo https://github.com/potassco/guide/releases/, the leading ASP solver. Before this work, only certain recursive aggregates were treated, others would result in an error message, as detailed in https://www.cambridge.org/core/journals/theory-and-practice-of-logic-programming/article/abs/design-and-implementation-of-aggregate-functions-in-the-dlv-system/0C2F675BE14929F6275E24DCAB5D695F. The significance of the research in this output is to enable the full language to be finally accepted, as shown in https://www.cambridge.org/core/journals/theory-and-practice-of-logic-programming/article/abs/design-and-implementation-of-aggregate-functions-in-the-dlv-system/0C2F675BE14929F6275E24DCAB5D695F.
- Author contribution statement
- -
- Non-English
- No
- English abstract
- -