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.
This work was supported by M.I.U.R. within the PRIN project LoDeN.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Gelfond, M., Lifschitz, V.: Classical Negation in Logic Programs and Disjunctive Databases. New Generation Computing 9, 365–385 (1991)
Wan, H., Kifer, M., Grosof, B.N.: Defeasibility in Answer Set Programs via Argumentation Theories. In: Hitzler, P., Lukasiewicz, T. (eds.) RR 2010. LNCS, vol. 6333, pp. 149–163. Springer, Heidelberg (2010)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2012 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Faber, W. (2012). A Polynomial Reduction from ASPDA to ASP. In: Krötzsch, M., Straccia, U. (eds) Web Reasoning and Rule Systems. RR 2012. Lecture Notes in Computer Science, vol 7497. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-33203-6_17
Download citation
DOI: https://doi.org/10.1007/978-3-642-33203-6_17
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-33202-9
Online ISBN: 978-3-642-33203-6
eBook Packages: Computer ScienceComputer Science (R0)