Chapter

Advances in Knowledge Representation, Logic Programming, and Abstract Argumentation

Volume 9060 of the series Lecture Notes in Computer Science pp 249-264

Reduction-Based Approaches to Implement Modgil’s Extended Argumentation Frameworks

  • Wolfgang DvořákAffiliated withFaculty of Computer Science, University of Vienna
  • , Sarah Alice GagglAffiliated withComputational Logic Group, Technische Universität Dresden
  • , Thomas LinsbichlerAffiliated withInstitute of Information Systems, Vienna University of Technology
  • , Johannes Peter WallnerAffiliated withInstitute of Information Systems, Vienna University of Technology

* Final gross prices may vary according to local VAT.

Get Access

Abstract

This paper reconsiders Modgil’s Extended Argumentation Frameworks (EAFs) that extend Dung’s abstract argumentation frameworks by attacks on attacks. This allows to encode preferences directly in the framework and thus also to reason about the preferences themselves. As a first step to reduction-based approaches to implement EAFs, we give an alternative (but equivalent) characterization of acceptance in EAFs. Then we use this characterization to provide EAF encodings for answer set programming and propositional logic. Moreover, we address an open complexity question and the expressiveness of EAFs.