Answer-set programming encodings for argumentation frameworks

Aus International Center for Computational Logic
Wechseln zu:Navigation, Suche

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
Argument & Computation, 1(2):147-177, 2010
  • KurzfassungAbstract
    Answer-set programming (ASP) has emerged as a declarative programming paradigm where problems are encoded as logic programs, such that the so-called answer sets of theses programs represent the solutions of the encoded problem. The efficiency of the latest ASP solvers reached a state that makes them applicable for problems of practical importance. Consequently, problems from many different areas, including diagnosis, data integration, and graph theory, have been successfully tackled via ASP. In this work, we present such ASP-encodings for problems associated to abstract argumentation frameworks (AFs) and generalisations thereof. Our encodings are formulated as fixed queries, such that the input is the only part depending on the actual AF to process. We illustrate the functioning of this approach, which is underlying a new argumentation system called ASPARTIX in detail and show its adequacy in terms of computational complexity.
  • Forschungsgruppe:Research Group: Computational Logic
@article{EGW2010,
  author    = {Uwe Egly and Sarah Alice Gaggl and Stefan Woltran},
  title     = {Answer-set programming encodings for argumentation frameworks},
  journal   = {Argument \& Computation},
  volume    = {1},
  number    = {2},
  publisher = {Taylor\&Francis},
  year      = {2010},
  pages     = {147-177},
  doi       = {10.1080/19462166.2010.486479}
}