A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2021; you can also visit the original URL.
The file type is
Declarative Algorithms and Complexity Results for Assumption-Based Argumentation
The Journal of Artificial Intelligence Research
The study of computational models for argumentation is a vibrant area of artificial intelligence and, in particular, knowledge representation and reasoning research. Arguments most often have an intrinsic structure made explicit through derivations from more basic structures. Computational models for structured argumentation enable making the internal structure of arguments explicit. Assumption-based argumentation (ABA) is a central structured formalism for argumentation in AI. In this article,doi:10.1613/jair.1.12479 fatcat:rajo2ynhezdpxbijlu3rx7nizy