Answer-Set Programming Encodings for Argumentation Frameworks

From International Center for Computational Logic

Toggle side column

Answer-Set Programming Encodings for Argumentation Frameworks

Uwe EglyUwe Egly,  Sarah Alice GagglSarah Alice Gaggl,  Stefan WoltranStefan Woltran
Uwe Egly, Sarah Alice Gaggl, Stefan Woltran
Answer-Set Programming Encodings for Argumentation Frameworks
1st Workshop on Answer Set Programming and Other Computing Paradigms (ASPOCP 2008), 2008
  • KurzfassungAbstract
    We present reductions from Dung’s argumentation framework (AF) and generalizations thereof to logic programs under the answer-set semantics. The reduction is based on a fixed disjunctive datalog program (the interpreter) and its input which is the only part depending on the AF to process. We discuss the reductions, which are the basis for the system ASPARTIX in detail and show their adequacy in terms of computational complexity.
  • Forschungsgruppe:Research Group: Computational LogicComputational LogicLogische Programmierung und ArgumentationLogic Programming and Argumentation
@inproceedings{EGW2008,
  author    = {Uwe Egly and Sarah Alice Gaggl and Stefan Woltran},
  title     = {Answer-Set Programming Encodings for Argumentation Frameworks},
  booktitle = {1st Workshop on Answer Set Programming and Other Computing
               Paradigms (ASPOCP 2008)},
  year      = {2008}
}