Optimal Status Enforcement in Abstract Argumentation
Proceedings of the Twenty-Fifth International Joint Conference on Artificial Intelligence. Pages 1216-1221.
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.
@inproceedings{ijcai2016p176,
title = {Optimal Status Enforcement in Abstract Argumentation},
author = {Niskanen, Andreas and Wallner, Johannes Peter and Järvisalo, Matti},
booktitle = {Proceedings of the Twenty-Fifth International Joint Conference on
Artificial Intelligence, {IJCAI-16}},
publisher = {AAAI Press / International Joint Conferences on Artificial Intelligence},
editor = {Subbarao Kambhampati},
pages = {1216--1221},
year = {2016},
month = {7},
url = {https://ijcai.org/proceedings/2016/176},
}
TY - CPAPER TI - Optimal Status Enforcement in Abstract Argumentation AU - Niskanen, Andreas AU - Wallner, Johannes Peter AU - Järvisalo, Matti T2 - Proceedings of the Twenty-Fifth International Joint Conference on Artificial Intelligence, IJCAI-16 PB - AAAI Press / International Joint Conferences on Artificial Intelligence PY - 2016 SP - 1216 EP - 1221 UR - https://ijcai.org/proceedings/2016/176 ER -Copied
Machine-readable versions of this paper, for tools and AI agents:
