On the Computation of Paracoherent Answer Sets
- Submitting institution
-
The University of Huddersfield
- Unit of assessment
- 11 - Computer Science and Informatics
- Output identifier
- 48
- Type
- E - Conference contribution
- DOI
-
-
- Title of conference / published proceedings
- Proceedings of the Thirty-First AAAI Conference on Artificial Intelligence : (AAAAI-17)
- First page
- 1034
- Volume
- -
- Issue
- -
- ISSN
- -
- Open access status
- -
- Month of publication
- February
- Year of publication
- 2017
- 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
-
4
- Research group(s)
-
-
- Citation count
- 6
- Proposed double-weighted
- No
- Reserve for an output with double weighting
- No
- Additional information
- Resulting from collaboration with the University of Calabria, via Huddersfield’s involvement in MIREL https://cordis.europa.eu/project/id/690974, this AAAI paper introduced algorithms to computer paracoherent answer sets of programs that normally do not admit any due to cyclic negation. These algorithms detect bugs in ASP when a paracoherent but no coherent answer set is computed. As an indication of their significance, they were used as the basis of one of the benchmarks (called 'Paracoherent Answer Sets') in the seventh biennial ASP Competition (as explained in Gebser at al. 2017, https://arxiv.org/pdf/1904.09134.pdf), and were extended in Faber’s (non-submitted) AAAI-2018 publication https://aaai.org/ocs/index.php/AAAI/AAAI18/paper/view/16244/15873
- Author contribution statement
- -
- Non-English
- No
- English abstract
- -