Efficient Computation of Deterministic Extensions for Dynamic Abstract Argumentation Frameworks

Abstract

ARGUMENTATION An (abstract) argumentation framework [1] (AF) is a pair 〈A,Σ〉, where A is a set of arguments and Σ ⊆ A×A is a set of attacks. – It allows representing dialogues, making decisions, and handling inconsistency; – An AF can be viewed as a direct graph, whose nodes are arguments and whose edges are attacks. SEMANTICS FOR AFS An argumentation… (More)
DOI: 10.3233/978-1-61499-672-9-1668

Topics

Cite this paper

@inproceedings{Greco2016EfficientCO, title={Efficient Computation of Deterministic Extensions for Dynamic Abstract Argumentation Frameworks}, author={Sergio Greco and Francesco Parisi}, booktitle={ECAI}, year={2016} }