Abstract
Assumption-Based Argumentation (ABA) [4, 3, 27, 11, 12, 20, 22] was developed, starting in the 90s, as a computational framework to reconcile and generalise most existing approaches to default reasoning [24, 25, 4, 3, 27, 26]. ABA was inspired by Dung's preferred extension semantics for logic programming [9, 7], with its dialectical interpretation of the acceptability of negation-as-failure assumptions based on the notion of "no-evidence-to-the- contrary" [9, 7], by the Kakas, Kowalski and Toni interpretation of the preferred extension semantics in argumentation-theoretic terms [24, 25], and by Dung's abstract argumentation (AA) [6, 8]. © 2009 Springer-Verlag US.
Cite
CITATION STYLE
Dung, P. M., Kowalski, R. A., & Toni, F. (2009). Assumption-based argumentation. In Argumentation in Artificial Intelligence (pp. 199–218). Springer US. https://doi.org/10.1007/978-0-387-98197-0_10
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.