IJCAI 2020poster0 citations
Controllability of Control Argumentation Frameworks
Andreas Niskanen, Daniel Neugebauer, Matti Järvisalo
Abstract
Control argumentation frameworks (CAFs) allow for modeling uncertainties inherent in various argumentative settings. We establish a complete computational complexity map of the central computational problem of controllability in CAFs for five key semantics. We also develop Boolean satisfiability based counterexample-guided abstraction refinement algorithms and direct encodings of controllability as quantified Boolean formulas, and empirically evaluate their scalability on a range of NP-hard variants of controllability.
Knowledge Representation and Reasoning: Computational Models of ArgumentKnowledge Representation and Reasoning: Computational Complexity of ReasoningConstraints and SAT: SAT: : Solvers and Applications
BibTeX
@inproceedings{ijcai2020p257,
title = {Controllability of Control Argumentation Frameworks},
author = {Niskanen, Andreas and Neugebauer, Daniel and Järvisalo, Matti},
booktitle = {Proceedings of the Twenty-Ninth International Joint Conference on
Artificial Intelligence, {IJCAI-20}},
publisher = {International Joint Conferences on Artificial Intelligence Organization},
editor = {Christian Bessiere},
pages = {1855--1861},
year = {2020},
month = {7},
note = {Main track},
doi = {10.24963/ijcai.2020/257},
url = {https://doi.org/10.24963/ijcai.2020/257},
}