AAAI

Association for the Advancement of Artificial Intelligence

Home > Proceedings / Proceedings of the AAAI Conference on Artificial Intelligence, 31 > No. 1: Thirty-First AAAI Conference On Artificial Intelligence

On the Computation of Paracoherent Answer Sets

Authors

Giovanni Amendola

University of Calabria


Carmine Dodaro

University of Calabria


Wolfgang Faber

University of Huddersfield


Nicola Leone

University of Calabria


Francesco Ricca

University of Calabria


Proceedings:

No. 1: Thirty-First AAAI Conference On Artificial Intelligence

Volume

Issue:

Proceedings of the AAAI Conference on Artificial Intelligence, 31

Track:

AAAI Technical Track: Knowledge Representation and Reasoning

Downloads:

Download PDF

Abstract:

Answer Set Programming (ASP) is a well-established formalism for nonmonotonic reasoning. An ASP program can have no answer set due to cyclic default negation. In this case, it is not possible to draw any conclusion, even if this is not intended. Recently, several paracoherent semantics have been proposed that address this issue,and several potential applications for these semantics have been identified. However, paracoherent semantics have essentially been inapplicable in practice, due to the lack of efficient algorithms and implementations. In this paper, this lack is addressed, and several different algorithms to compute semi-stable and semi-equilibrium models are proposed and implemented into an answer set solving framework. An empirical performance comparison among the new algorithms on benchmarks from ASP competitions is given as well.

DOI:

10.1609/aaai.v31i1.10679


AAAI

Proceedings of the AAAI Conference on Artificial Intelligence, 31