- 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
Taking into account “who said what” in abstract argumentation: Complexity results
Artificial Intelligence 318 (C):103885 (2023)
Abstract
This article has no associated abstract. (fix it)My notes
Similar books and articles
Algorithms and complexity results for persuasive argumentation.Eun Jung Kim, Sebastian Ordyniak & Stefan Szeider - 2011 - Artificial Intelligence 175 (9-10):1722-1736.
Complexity-sensitive decision procedures for abstract argumentation.Wolfgang Dvořák, Matti Järvisalo, Johannes Peter Wallner & Stefan Woltran - 2014 - Artificial Intelligence 206 (C):53-78.
Complexity of abstract argumentation under a claim-centric view.Wolfgang Dvořák & Stefan Woltran - 2020 - Artificial Intelligence 285 (C):103290.
Complexity of fundamental problems in probabilistic abstract argumentation: Beyond independence.Bettina Fazzinga, Sergio Flesca & Filippo Furfaro - 2019 - Artificial Intelligence 268 (C):1-29.
The complexity landscape of claim-augmented argumentation frameworks.Wolfgang Dvořák, Alexander Greßler, Anna Rapberger & Stefan Woltran - 2023 - Artificial Intelligence 317 (C):103873.
On the computational complexity of assumption-based argumentation for default reasoning.Yannis Dimopoulos, Bernhard Nebel & Francesca Toni - 2002 - Artificial Intelligence 141 (1-2):57-78.
A general account of argumentation with preferences.Sanjay Modgil & Henry Prakken - 2013 - Artificial Intelligence 195 (C):361-397.
Computational complexity of flat and generic Assumption-Based Argumentation, with and without probabilities.Kristijonas Čyras, Quentin Heinrich & Francesca Toni - 2021 - Artificial Intelligence 293 (C):103449.
The first international competition on computational models of argumentation: Results and analysis.Matthias Thimm & Serena Villata - 2017 - Artificial Intelligence 252 (C):267-294.
Design and results of the Second International Competition on Computational Models of Argumentation.Sarah A. Gaggl, Thomas Linsbichler, Marco Maratea & Stefan Woltran - 2020 - Artificial Intelligence 279 (C):103193.
Analytics
Added to PP
2023-02-26
Downloads
12 (#317,170)
6 months
6 (#1,472,471)
2023-02-26
Downloads
12 (#317,170)
6 months
6 (#1,472,471)
Historical graph of downloads
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.
Coherence in finite argument systems.Paul E. Dunne & T. J. M. Bench-Capon - 2002 - Artificial Intelligence 141 (1-2):187-203.
Weighted argument systems: Basic definitions, algorithms, and complexity results.Paul E. Dunne, Anthony Hunter, Peter McBurney, Simon Parsons & Michael Wooldridge - 2011 - Artificial Intelligence 175 (2):457-486.
Acceptance in incomplete argumentation frameworks.Dorothea Baumeister, Matti Järvisalo, Daniel Neugebauer, Andreas Niskanen & Jörg Rothe - 2021 - Artificial Intelligence 295 (C):103470.
Verification in incomplete argumentation frameworks.Dorothea Baumeister, Daniel Neugebauer, Jörg Rothe & Hilmar Schadrack - 2018 - Artificial Intelligence 264 (C):1-26.
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-68866f4b87-lc8fp uwo