On the Computation of Paracoherent Answer Sets

Giovanni Amendola, Carmine Dodaro, Wolfgang Faber, Nicola Leone, Francesco Ricca

Research output: Chapter in Book/Report/Conference proceedingConference contribution


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.
Original languageEnglish
Title of host publicationProceedings of the Thirty-First AAAI Conference on Artificial Intelligence, February 4-9, 2017, San Francisco, California, USA.
PublisherAAAI Press
Number of pages7
ISBN (Print)978-1-57735-781-0
Publication statusPublished - 31 Jul 2017
EventThirty-First AAAI Conference on Artificial Intelligence - San Francisco, United States
Duration: 4 Feb 20179 Feb 2017

Publication series

ISSN (Print)2159-5399
ISSN (Electronic)2374-3468


ConferenceThirty-First AAAI Conference on Artificial Intelligence
Abbreviated titleAAAI-17
Country/TerritoryUnited States
CitySan Francisco
Internet address


Dive into the research topics of 'On the Computation of Paracoherent Answer Sets'. Together they form a unique fingerprint.

Cite this