- 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
Computational complexity of flat and generic Assumption-Based Argumentation, with and without probabilities
Artificial Intelligence 293 (C):103449 (2021)
Abstract
This article has no associated abstract. (fix it)Author's Profile
My notes
Similar books and articles
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.
Argument graphs and assumption-based argumentation.Robert Craven & Francesca Toni - 2016 - Artificial Intelligence 233 (C):1-59.
A generalised framework for dispute derivations in assumption-based argumentation.Francesca Toni - 2013 - Artificial Intelligence 195 (C):1-43.
A general framework for sound assumption-based argumentation dialogues.Xiuyi Fan & Francesca Toni - 2014 - Artificial Intelligence 216 (C):20-54.
Dialectic proof procedures for assumption-based, admissible argumentation.P. M. Dung, R. A. Kowalski & F. Toni - 2006 - Artificial Intelligence 170 (2):114-159.
Assumption-based argumentation for closed and consistent defeasible reasoning.Francesca Toni - 2008 - In Takashi Washio, Ken Satoh, Hideaki Takeda & Akihiro Inokuchi (eds.), New Frontiers in Artificial Intelligence. Springer. pp. 390--402.
Syntactic reasoning with conditional probabilities in deductive argumentation.Anthony Hunter & Nico Potyka - 2023 - Artificial Intelligence 321 (C):103934.
The complexity of approximating MAPs for belief networks with bounded probabilities.Ashraf M. Abdelbar, Stephen T. Hedetniemi & Sandra M. Hedetniemi - 2000 - Artificial Intelligence 124 (2):283-288.
The computational complexity of abduction.Tom Bylander, Dean Allemang, Michael C. Tanner & John R. Josephson - 1991 - Artificial Intelligence 49 (1-3):25-60.
The computational complexity of ideal semantics.Paul E. Dunne - 2009 - Artificial Intelligence 173 (18):1559-1591.
Analytics
Added to PP
2021-01-06
Downloads
26 (#597,230)
6 months
13 (#278,026)
2021-01-06
Downloads
26 (#597,230)
6 months
13 (#278,026)
Historical graph of downloads
Author's Profile
Citations of this work
Explainable acceptance in probabilistic and incomplete abstract argumentation frameworks.Gianvincenzo Alfano, Marco Calautti, Sergio Greco, Francesco Parisi & Irina Trubitsyna - 2023 - Artificial Intelligence 323 (C):103967.
Forecasting with jury-based probabilistic argumentation.Francesca Toni, Antonio Rago & Kristijonas Čyras - 2023 - Journal of Applied Non-Classical Logics 33 (3):224-243.
Syntactic reasoning with conditional probabilities in deductive argumentation.Anthony Hunter & Nico Potyka - 2023 - Artificial Intelligence 321 (C):103934.
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.
Applications of Circumscription to Formalizing Common Sense Knowledge.John McCarthy - 1986 - Artificial Intelligence 28 (1):89–116.
Semantic Considerations on nonmonotonic Logic.Robert C. Moore - 1985 - Artificial Intelligence 25 (1):75-94.
The ASPIC+ framework for structured argumentation: a tutorial.Sanjay Modgil & Henry Prakken - 2014 - Argument and Computation 5 (1):31-62.
The Carneades model of argument and burden of proof.Thomas F. Gordon, Henry Prakken & Douglas Walton - 2007 - Artificial Intelligence 171 (10-15):875-896.
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-6686886f5-5pqs9 uwo