A polynomial reduction from ASPDA to ASP

Authors:
Wolfgang Faber
Affiliations:
Department of Mathematics, University of Calabria, Rende (CS), Italy
Venue:
RR'12 Proceedings of the 6th international conference on Web Reasoning and Rule Systems
Year:
2012

Citing 1
Cited 0

Defeasibility in answer set programs via argumentation theories

RR'10 Proceedings of the Fourth international conference on Web reasoning and rule systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

ASPDA is a framework for expressing defeasibility in Answer Set Programs via so-called argumentation theories, proposed by Wan, Kifer, and Grosof in [2]. The authors describe a reduction from ASPDA to plain Answer Set Programming, which however exponentially inflate programs. In this note, we present an alternative reduction, which does not suffer from this problem. As a side-effect, complexity results for ASPDA are established.