Automata for infinite argumentation structures

, , &
Artificial Intelligence 203 (C):104-150 (2013)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Keywords

Reprint years

DOI

10.1016/j.artint.2013.05.002

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 91,122

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

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.
Different similarities.Miloš S. Kurilić - 2015 - Archive for Mathematical Logic 54 (7-8):839-859.

Analytics

Added to PP
2020-12-22

Downloads
6 (#1,353,689)

6 months
2 (#1,015,942)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

Characterizing strongly admissible sets.Paul E. Dunne - 2020 - Argument and Computation 11 (3):239-255.

Add more citations

References found in this work

Reasoning about preferences in argumentation frameworks.Sanjay Modgil - 2009 - Artificial Intelligence 173 (9-10):901-934.

View all 28 references / Add more references