Totality, determinism and functionality problems in (incomplete) abstract argumentation frameworks
Journal of Logic and Computation · 29.04.2026 · 36 (4)
DOI: 10.1093/logcom/exag025 ↗Kurz gefasst
Fachartikel in der Zeitschrift Journal of Logic and Computation, online erschienen am 08.06.2026. Verfasst von Gianvincenzo Alfano und 3 weiteren Autor:innen. Die Arbeit nennt 83 Literaturangaben. Der Volltext ist frei zugänglich (Open Access, CC BY 4.0).
Abstract (Originalsprache)
Dung’s abstract argumentation framework (AF) has emerged as a central formalism in the area of knowledge representation and reasoning. Several research studies have been conducted to expand AF to encompass various aspects, such as the representation of (unquantified) uncertainty, that give rise to the so-called incomplete AF (iAF), where some of the arguments and attacks may be uncertain. In this paper, we introduce three new reasoning problems named totality, determinism and functionality, and investigate their computational complexity for both AF and iAF under several semantics. Intuitively, an argument is said to be deterministic if all extensions assign the same status (either accepted, rejected or undefined) to it, whereas it is said to be total if for all extensions it is either accepted or rejected. When both totality and determinism hold for a given argument, we say that it is functional. We also investigate the complexity of credulous and skeptical acceptance in iAF under semi-stable semantics—a problem left open in the literature. We then show that any iAF can be rewritten into an equivalent one where either only (unattacked) arguments or only attacks are uncertain.
Zitieren
APA
Alfano, G., Greco, S., Parisi, F., & Trubitsyna, I. (2026). Totality, determinism and functionality problems in (incomplete) abstract argumentation frameworks. Journal of Logic and Computation, 36(4). https://doi.org/10.1093/logcom/exag025
Vancouver
Alfano G, Greco S, Parisi F, Trubitsyna I. Totality, determinism and functionality problems in (incomplete) abstract argumentation frameworks. Journal of Logic and Computation. 2026;36(4). doi:10.1093/logcom/exag025
BibTeX
@article{Alfano2026,
author = {Alfano, Gianvincenzo and Greco, Sergio and Parisi, Francesco and Trubitsyna, Irina},
title = {Totality, determinism and functionality problems in (incomplete) abstract argumentation frameworks},
journal = {Journal of Logic and Computation},
year = {2026},
volume = {36},
number = {4},
doi = {10.1093/logcom/exag025}
}
EUVIMED