ML Anthology

The Relative Expressiveness of Abstract Argumentation and Logic Programming

Hannes Strass
AAAI 2015 pp. 1625-1631
doi:10.1609/AAAI.V29I1.9392 /aaai/2015/strass2015aaai-relative/

Abstract

We analyze the relative expressiveness of the two-valued semantics of abstract argumentation frameworks, normal logic programs and abstract dialectical frameworks. By expressiveness we mean the ability to encode a desired set of two-valued interpretations over a given propositional vocabulary A using only atoms from A. While the computational complexity of the two-valued model existence problem for all these languages is (almost) the same, we show that the languages form a neat hierarchy with respect to their expressiveness. We then demonstrate that this hierarchy collapses once we allow to introduce a linear number of new vocabulary elements.

PDF AAAI Semantic Scholar

Cite

Text

Strass. "The Relative Expressiveness of Abstract Argumentation and Logic Programming." AAAI Conference on Artificial Intelligence, 2015. doi:10.1609/AAAI.V29I1.9392

Markdown

[Strass. "The Relative Expressiveness of Abstract Argumentation and Logic Programming." AAAI Conference on Artificial Intelligence, 2015.](https://mlanthology.org/aaai/2015/strass2015aaai-relative/) doi:10.1609/AAAI.V29I1.9392

BibTeX

@inproceedings{strass2015aaai-relative,
  title     = {{The Relative Expressiveness of Abstract Argumentation and Logic Programming}},
  author    = {Strass, Hannes},
  booktitle = {AAAI Conference on Artificial Intelligence},
  year      = {2015},
  pages     = {1625-1631},
  doi       = {10.1609/AAAI.V29I1.9392},
  url       = {https://mlanthology.org/aaai/2015/strass2015aaai-relative/}
}