On the Computation of Paracoherent Answer Sets

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

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

14 Citations (Scopus)

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.
LanguageEnglish
Title of host publicationProceedings of the Thirty-First AAAI Conference on Artificial Intelligence
Subtitle of host publication(AAAAI-17)
EditorsSatinder Singh, Shaul Markovitch
PublisherAAAI press
Pages1034-1040
Number of pages7
Volume1
ISBN (Print)1577357809, 9781577357803
Publication statusPublished - Jul 2017
Event31st Association for the Advancement of Artificial Intelligence Conference on Artificial Intelligence - Hilton San Francisco Union Square, San Francisco, United States
Duration: 4 Feb 20179 Feb 2017
Conference number: 31
https://aaai.org/ocs/index.php/AAAI/AAAI17/index (Link to Conference Details)

Conference

Conference31st Association for the Advancement of Artificial Intelligence Conference on Artificial Intelligence
Abbreviated titleAAAI-17
CountryUnited States
CitySan Francisco
Period4/02/179/02/17
Internet address

Fingerprint

Semantics

Cite this

Amendola, G., Dorado, C., Faber, W., Leone, N., & Ricca, F. (2017). On the Computation of Paracoherent Answer Sets. In S. Singh, & S. Markovitch (Eds.), Proceedings of the Thirty-First AAAI Conference on Artificial Intelligence: (AAAAI-17) (Vol. 1, pp. 1034-1040). AAAI press.
Amendola, Giovanni ; Dorado, Carmine ; Faber, Wolfgang ; Leone, Nicola ; Ricca, Francesco. / On the Computation of Paracoherent Answer Sets. Proceedings of the Thirty-First AAAI Conference on Artificial Intelligence: (AAAAI-17). editor / Satinder Singh ; Shaul Markovitch. Vol. 1 AAAI press, 2017. pp. 1034-1040
@inproceedings{b9003a3bc0234f8e90333212dc87f9b3,
title = "On the Computation of Paracoherent Answer Sets",
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.",
keywords = "Answer Set Programming, Paracoherent Answer Set, Inconsistency Tolerance, Nonmonotonic Reasoning",
author = "Giovanni Amendola and Carmine Dorado and Wolfgang Faber and Nicola Leone and Francesco Ricca",
note = "Publisher will not allow accepted version to be viewable via repository. Also cannot find ISBN or ISSN. HN 11/10/2017",
year = "2017",
month = "7",
language = "English",
isbn = "1577357809",
volume = "1",
pages = "1034--1040",
editor = "Satinder Singh and Shaul Markovitch",
booktitle = "Proceedings of the Thirty-First AAAI Conference on Artificial Intelligence",
publisher = "AAAI press",

}

Amendola, G, Dorado, C, Faber, W, Leone, N & Ricca, F 2017, On the Computation of Paracoherent Answer Sets. in S Singh & S Markovitch (eds), Proceedings of the Thirty-First AAAI Conference on Artificial Intelligence: (AAAAI-17). vol. 1, AAAI press, pp. 1034-1040, 31st Association for the Advancement of Artificial Intelligence Conference on Artificial Intelligence, San Francisco, United States, 4/02/17.

On the Computation of Paracoherent Answer Sets. / Amendola, Giovanni; Dorado, Carmine; Faber, Wolfgang; Leone, Nicola; Ricca, Francesco.

Proceedings of the Thirty-First AAAI Conference on Artificial Intelligence: (AAAAI-17). ed. / Satinder Singh; Shaul Markovitch. Vol. 1 AAAI press, 2017. p. 1034-1040.

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

TY - GEN

T1 - On the Computation of Paracoherent Answer Sets

AU - Amendola, Giovanni

AU - Dorado, Carmine

AU - Faber, Wolfgang

AU - Leone, Nicola

AU - Ricca, Francesco

N1 - Publisher will not allow accepted version to be viewable via repository. Also cannot find ISBN or ISSN. HN 11/10/2017

PY - 2017/7

Y1 - 2017/7

N2 - 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.

AB - 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.

KW - Answer Set Programming

KW - Paracoherent Answer Set

KW - Inconsistency Tolerance

KW - Nonmonotonic Reasoning

UR - https://aaai.org/Press/Proceedings/aaai17.php

M3 - Conference contribution

SN - 1577357809

SN - 9781577357803

VL - 1

SP - 1034

EP - 1040

BT - Proceedings of the Thirty-First AAAI Conference on Artificial Intelligence

A2 - Singh, Satinder

A2 - Markovitch, Shaul

PB - AAAI press

ER -

Amendola G, Dorado C, Faber W, Leone N, Ricca F. On the Computation of Paracoherent Answer Sets. In Singh S, Markovitch S, editors, Proceedings of the Thirty-First AAAI Conference on Artificial Intelligence: (AAAAI-17). Vol. 1. AAAI press. 2017. p. 1034-1040