id: 06104232
dt: a
an: 06104232
au: Faber, Wolfgang
ti: A polynomial reduction from ASPDA to ASP.
so: Krötzsch, Markus (ed.) et al., Web reasoning and rule systems. 6th
    international conference, RR 2012, Vienna, Austria, September 10‒12,
    2012. Proceedings. Berlin: Springer (ISBN 978-3-642-33202-9/pbk).
    Lecture Notes in Computer Science 7497, 213-216 (2012).
py: 2012
pu: Berlin: Springer
la: EN
cc: 
ut: 
ci: 
li: doi:10.1007/978-3-642-33203-6_17
ab: Summary: 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.
rv: