- New
-
Topics
- All Categories
- Metaphysics and Epistemology
- Value Theory
- Science, Logic, and Mathematics
- Science, Logic, and Mathematics
- Logic and Philosophy of Logic
- Philosophy of Biology
- Philosophy of Cognitive Science
- Philosophy of Computing and Information
- Philosophy of Mathematics
- Philosophy of Physical Science
- Philosophy of Social Science
- Philosophy of Probability
- General Philosophy of Science
- Philosophy of Science, Misc
- History of Western Philosophy
- Philosophical Traditions
- Philosophy, Misc
- Other Academic Areas
- Journals
- Submit material
- More
Automata for infinite argumentation structures
Artificial Intelligence 203 (C):104-150 (2013)
Abstract
This article has no associated abstract. (fix it)Other Versions
No versions found
My notes
Similar books and articles
Learning infinite-word automata with loop-index queries.Jakub Michaliszyn & Jan Otop - 2022 - Artificial Intelligence 307 (C):103710.
Strong admissibility revisited: Theory and applications.Martin Caminada & Paul Dunne - 2020 - Argument and Computation 10 (3):277-300.
Informal Logic, Argumentation Theory and Artificial Intelligence.Michael A. Gilbert - 2002 - Informal Logic 22 (3).
Stefano Franchi and Güven Güzeldere, eds., Mechanical Bodies, Computational Minds: Artificial Intelligence from Automata to Cyborgs Reviewed by.John Sutton - 2006 - Philosophy in Review 26 (6):414-416.
Automata Theory, Artificial Intelligence and Genetic Epistemology.Mark H. Bickhard - 1982 - Revue Internationale de Philosophie 36 (4):549.
Sat-based verification of security protocols via translation to networks of automata.Mirosław Kurkowski, Wojciech Penczek & Andrzej Zbrzezny - 2007 - In A. Lomuscio & S. Edelkamp (eds.), Model Checking and Artificial Intelligence. Springer. pp. 146--165.
Artificial argument assistants for defeasible argumentation.Bart Verheij - 2003 - Artificial Intelligence 150 (1-2):291-324.
Erratum to: Reasoning with infinite stable models [Artificial Intelligence 156 (1) (2004) 75–111].Piero A. Bonatti - 2008 - Artificial Intelligence 172 (15):1833-1835.
Bisimulation between base argumentation and premise-conclusion argumentation.Jinsheng Chen, Beishui Liao & Leendert van der Torre - 2024 - Artificial Intelligence 336 (C):104203.
Analytics
Added to PP
2020-12-22
Downloads
18 (#1,002,632)
6 months
5 (#898,127)
2020-12-22
Downloads
18 (#1,002,632)
6 months
5 (#898,127)
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.
A general approach to extension-based semantics in abstract argumentation.Lixing Tan, Zhaohui Zhu & Jinjin Zhang - 2023 - Artificial Intelligence 315 (C):103836.
Characterizing strongly admissible sets.Paul E. Dunne - 2020 - Argument and Computation 11 (3):239-255.
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.
PhilPapers logo by Andrea Andrews and Meghan Driscoll.
This site uses cookies and Google Analytics (see our terms & conditions for details regarding the privacy implications). Use of this site is subject to terms & conditions.
All rights reserved by The PhilPapers Foundation
Server: philpapers-web-5d8df9484f-nsbkm uwo