Automata for infinite argumentation structures
Artificial Intelligence 203 (C):104-150 (2013)
Abstract
This article has no associated abstract. (fix it)My notes
Similar books and articles
On the Input/Output behavior of argumentation frameworks.Pietro Baroni, Guido Boella, Federico Cerutti, Massimiliano Giacomin, Leendert van der Torre & Serena Villata - 2014 - Artificial Intelligence 217 (C):144-197.
On topology-related properties of abstract argumentation semantics. A correction and extension to Dynamics of argumentation systems: A division-based method.Pietro Baroni, Massimiliano Giacomin & Beishui Liao - 2014 - Artificial Intelligence 212 (C):104-115.
SCC-recursiveness: a general schema for argumentation semantics.Pietro Baroni, Massimiliano Giacomin & Giovanni Guida - 2005 - Artificial Intelligence 168 (1-2):162-210.
How we designed winning algorithms for abstract argumentation and which insight we attained.Federico Cerutti, Massimiliano Giacomin & Mauro Vallati - 2019 - Artificial Intelligence 276 (C):1-40.
Complex Argumentation in a Critical Discussion.A. F. Snoeck Henkemans - 2003 - Argumentation 17 (4):405-419.
On principle-based evaluation of extension-based argumentation semantics.Pietro Baroni & Massimiliano Giacomin - 2007 - Artificial Intelligence 171 (10-15):675-700.
A general semi-structured formalism for computational argumentation: Definition, properties, and examples of application.Pietro Baroni, Massimiliano Giacomin & Beishui Liao - 2018 - Artificial Intelligence 257 (C):158-207.
Progress measures, immediate determinacy, and a subset construction for tree automata.Nils Klarlund - 1994 - Annals of Pure and Applied Logic 69 (2-3):243-268.
Progress measures, immediate determinacy, and a subset construction for tree automata.Hiroshi Nakano - 1994 - Annals of Pure and Applied Logic 69 (2-3):243-268.
Rhetorical Structures, Deliberative Ecologies, and the Conditions for Democratic Argumentation.Robert Danisch - 2020 - Argumentation 34 (3):339-353.
On Gratton’s Infinite Regress Arguments: Claude Gratton: Infinite Regress Arguments. In Argumentation Library . Springer, Dordrecht, 2010. [REVIEW]Jan Willem Wieland - 2011 - Argumentation 25 (1):107-113.
On the resolution-based family of abstract argumentation semantics and its grounded instance.P. Baroni, P. E. Dunne & M. Giacomin - 2011 - Artificial Intelligence 175 (3-4):791-813.
Michael O. Rabin. Decidability of second-order theories and automata on infinite trees. Bulletin of the American Mathematical Society, vol. 74 , pp. 1025–1029. - Michael O. Rabin. Decidability of second-order theories and automata on infinite trees. Transactions of the American Mathematical Society, vol. 141 , pp. 1–35. [REVIEW]Dirk Siefkes - 1972 - Journal of Symbolic Logic 37 (3):618-619.
Alternating automata and temporal logic normal forms.Clare Dixon, Alexander Bolotov & Michael Fisher - 2005 - Annals of Pure and Applied Logic 135 (1-3):263-285.
Analytics
Added to PP
2020-12-22
Downloads
2 (#1,400,884)
6 months
2 (#297,033)
2020-12-22
Downloads
2 (#1,400,884)
6 months
2 (#297,033)
Historical graph of downloads
Citations of this work
How we designed winning algorithms for abstract argumentation and which insight we attained.Federico Cerutti, Massimiliano Giacomin & Mauro Vallati - 2019 - Artificial Intelligence 276 (C):1-40.
An experimental analysis on the similarity of argumentation semantics.Federico Cerutti, Matthias Thimm & Mauro Vallati - 2020 - Argument and Computation 11 (3):269-304.
Characterizing strongly admissible sets.Paul E. Dunne - 2020 - Argument and Computation 11 (3):239-255.
A general approach to extension-based semantics in abstract argumentation.Lixing Tan, Zhaohui Zhu & Jinjin Zhang - 2023 - Artificial Intelligence 315 (C):103836.
References found in this work
On the acceptability of arguments and its fundamental role in nonmonotonic reasoning, logic programming and n-person games.Phan Minh Dung - 1995 - Artificial Intelligence 77 (2):321-357.
An abstract framework for argumentation with structured arguments.Henry Prakken - 2010 - Argument and Computation 1 (2):93-124.
An abstract, argumentation-theoretic approach to default reasoning.A. Bondarenko, P. M. Dung, R. A. Kowalski & F. Toni - 1997 - Artificial Intelligence 93 (1-2):63-101.
Reasoning about preferences in argumentation frameworks.Sanjay Modgil - 2009 - Artificial Intelligence 173 (9-10):901-934.
A mathematical treatment of defeasible reasoning and its implementation.Guillermo R. Simari & Ronald P. Loui - 1992 - Artificial Intelligence 53 (2-3):125-157.
