ML Anthology

Optimal Status Enforcement in Abstract Argumentation

Andreas Niskanen, Johannes Peter Wallner, Matti Järvisalo
IJCAI 2016 pp. 1216-1222
/ijcai/2016/niskanen2016ijcai-optimal/

Abstract

We present complexity results and algorithms for optimal status enforcement in abstract argumentation. Status enforcement is the task of adjusting a given argumentation framework (AF) to support given positive and negative argument statuses, i.e., to accept and reject specific arguments. We study optimal status enforcement as the problem of finding a structurally closest AF supporting given argument statuses. We establish complexity results for optimal status enforcement under several central AF semantics, develop constraint-based algorithms for NP and second-level complete variants of the problem, and empirically evaluate the procedures. PDF

PDF IJCAI Semantic Scholar

Cite

Text

Niskanen et al. "Optimal Status Enforcement in Abstract Argumentation." International Joint Conference on Artificial Intelligence, 2016.

Markdown

[Niskanen et al. "Optimal Status Enforcement in Abstract Argumentation." International Joint Conference on Artificial Intelligence, 2016.](https://mlanthology.org/ijcai/2016/niskanen2016ijcai-optimal/)

BibTeX

@inproceedings{niskanen2016ijcai-optimal,
  title     = {{Optimal Status Enforcement in Abstract Argumentation}},
  author    = {Niskanen, Andreas and Wallner, Johannes Peter and Järvisalo, Matti},
  booktitle = {International Joint Conference on Artificial Intelligence},
  year      = {2016},
  pages     = {1216-1222},
  url       = {https://mlanthology.org/ijcai/2016/niskanen2016ijcai-optimal/}
}