Externally Supported Models for Efficient Computation of Paracoherent Answer Sets

Giovanni Amendola, Carmine Dodaro, Wolfgang Faber, Francesco Ricca

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

9 Citations (Scopus)

Abstract

Answer Set Programming (ASP) is a well established formalism for nonmonotonic reasoning. While incoherence, the non-existence of answer sets for some programs, is an important feature of ASP, it has frequently been criticised and indeed has some disadvantages, especially for query answering. Paracoherent semantics have been suggested as a remedy, which extend the classical notion of answer sets to draw meaningful conclusions also from incoherent programs. In this paper we present an alternative characterization of the two major paracoherent semantics in terms of (extended) externally supported models. This definition uses a transformation of ASP programs that is more parsimonious than the classic epistemic transformation used in recent implementations. A performance comparison carried out on benchmarks from ASP competitions shows that the usage of the new transformation brings about performance improvements that are independent of the underlying algorithms.
LanguageEnglish
Title of host publicationProceedings of the Thirty-Second AAAI Conference on Artificial Intelligence
EditorsSheila McIlraith, Kilian Weinberger
PublisherAAAI press
Number of pages8
Publication statusPublished - 25 Apr 2018
Event32nd Association for the Advancement of Artificial Intelligence Conference - Hilton New Orleans Riverside, New Orleans, United States
Duration: 2 Feb 20187 Feb 2018
Conference number: 32
https://aaai.org/Conferences/AAAI-18/ (Link to Conference Details)

Conference

Conference32nd Association for the Advancement of Artificial Intelligence Conference
Abbreviated titleAAAI-18
CountryUnited States
CityNew Orleans
Period2/02/187/02/18
Internet address

Fingerprint

Semantics

Cite this

Amendola, G., Dodaro, C., Faber, W., & Ricca, F. (2018). Externally Supported Models for Efficient Computation of Paracoherent Answer Sets. In S. McIlraith, & K. Weinberger (Eds.), Proceedings of the Thirty-Second AAAI Conference on Artificial Intelligence AAAI press.
Amendola, Giovanni ; Dodaro, Carmine ; Faber, Wolfgang ; Ricca, Francesco. / Externally Supported Models for Efficient Computation of Paracoherent Answer Sets. Proceedings of the Thirty-Second AAAI Conference on Artificial Intelligence. editor / Sheila McIlraith ; Kilian Weinberger. AAAI press, 2018.
@inproceedings{e105bdf4df314bf6b538638b645d39be,
title = "Externally Supported Models for Efficient Computation of Paracoherent Answer Sets",
abstract = "Answer Set Programming (ASP) is a well established formalism for nonmonotonic reasoning. While incoherence, the non-existence of answer sets for some programs, is an important feature of ASP, it has frequently been criticised and indeed has some disadvantages, especially for query answering. Paracoherent semantics have been suggested as a remedy, which extend the classical notion of answer sets to draw meaningful conclusions also from incoherent programs. In this paper we present an alternative characterization of the two major paracoherent semantics in terms of (extended) externally supported models. This definition uses a transformation of ASP programs that is more parsimonious than the classic epistemic transformation used in recent implementations. A performance comparison carried out on benchmarks from ASP competitions shows that the usage of the new transformation brings about performance improvements that are independent of the underlying algorithms.",
author = "Giovanni Amendola and Carmine Dodaro and Wolfgang Faber and Francesco Ricca",
note = "Copyright {\circledC} 2018, Association for the Advancement of Artificial Intelligence (www.aaai.org). All rights reserved",
year = "2018",
month = "4",
day = "25",
language = "English",
editor = "Sheila McIlraith and Kilian Weinberger",
booktitle = "Proceedings of the Thirty-Second AAAI Conference on Artificial Intelligence",
publisher = "AAAI press",

}

Amendola, G, Dodaro, C, Faber, W & Ricca, F 2018, Externally Supported Models for Efficient Computation of Paracoherent Answer Sets. in S McIlraith & K Weinberger (eds), Proceedings of the Thirty-Second AAAI Conference on Artificial Intelligence. AAAI press, 32nd Association for the Advancement of Artificial Intelligence Conference , New Orleans, United States, 2/02/18.

Externally Supported Models for Efficient Computation of Paracoherent Answer Sets. / Amendola, Giovanni; Dodaro, Carmine; Faber, Wolfgang; Ricca, Francesco.

Proceedings of the Thirty-Second AAAI Conference on Artificial Intelligence. ed. / Sheila McIlraith; Kilian Weinberger. AAAI press, 2018.

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

TY - GEN

T1 - Externally Supported Models for Efficient Computation of Paracoherent Answer Sets

AU - Amendola, Giovanni

AU - Dodaro, Carmine

AU - Faber, Wolfgang

AU - Ricca, Francesco

N1 - Copyright © 2018, Association for the Advancement of Artificial Intelligence (www.aaai.org). All rights reserved

PY - 2018/4/25

Y1 - 2018/4/25

N2 - Answer Set Programming (ASP) is a well established formalism for nonmonotonic reasoning. While incoherence, the non-existence of answer sets for some programs, is an important feature of ASP, it has frequently been criticised and indeed has some disadvantages, especially for query answering. Paracoherent semantics have been suggested as a remedy, which extend the classical notion of answer sets to draw meaningful conclusions also from incoherent programs. In this paper we present an alternative characterization of the two major paracoherent semantics in terms of (extended) externally supported models. This definition uses a transformation of ASP programs that is more parsimonious than the classic epistemic transformation used in recent implementations. A performance comparison carried out on benchmarks from ASP competitions shows that the usage of the new transformation brings about performance improvements that are independent of the underlying algorithms.

AB - Answer Set Programming (ASP) is a well established formalism for nonmonotonic reasoning. While incoherence, the non-existence of answer sets for some programs, is an important feature of ASP, it has frequently been criticised and indeed has some disadvantages, especially for query answering. Paracoherent semantics have been suggested as a remedy, which extend the classical notion of answer sets to draw meaningful conclusions also from incoherent programs. In this paper we present an alternative characterization of the two major paracoherent semantics in terms of (extended) externally supported models. This definition uses a transformation of ASP programs that is more parsimonious than the classic epistemic transformation used in recent implementations. A performance comparison carried out on benchmarks from ASP competitions shows that the usage of the new transformation brings about performance improvements that are independent of the underlying algorithms.

UR - https://www.aaai.org/ocs/index.php/AAAI/AAAI18

M3 - Conference contribution

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

A2 - McIlraith, Sheila

A2 - Weinberger, Kilian

PB - AAAI press

ER -

Amendola G, Dodaro C, Faber W, Ricca F. Externally Supported Models for Efficient Computation of Paracoherent Answer Sets. In McIlraith S, Weinberger K, editors, Proceedings of the Thirty-Second AAAI Conference on Artificial Intelligence. AAAI press. 2018