Access the full text.
Sign up today, get DeepDyve free for 14 days.
Thomas Lukasiewicz (2005)
Probabilistic description logic programsInt. J. Approx. Reason., 45
R. Haenni, J. Kohlas, N. Lehmann (2000)
Probabilistic argumentation systemsHandbook of Defeasible Reasoning and Uncertainty Management Systems, 5
S. Gaggl, S. Woltran (2013)
The cf2 argumentation semantics revisitedJ. Log. Comput., 23
Bettina Fazzinga, S. Flesca, F. Parisi (2013)
Efficiently Estimating the Probability of Extensions in Abstract Argumentation
N. Oren, T. Norman (2008)
Semantics for Evidence-Based Argumentation
(2015)
Article 22, Publication date
Michael R. Garey, David S. Johnson (1979)
Computers and Intractability: A Guide to the Theory of NP-CompletenessW. H. Freeman & Co.
Thomas Lukasiewicz (2001)
Probabilistic logic programming with conditional constraintsACM Trans. Comput. Log., 2
Abhay Jha, Dan Suciu (2011)
Knowledge Compilation Meets Database Theory: Compiling Queries to Decision DiagramsTheory of Computing Systems, 52
Matthias Thimm (2012)
A Probabilistic Semantics for abstract Argumentation
J. Kohlas, S. Moral (2000)
Algorithms for uncertainty and defeasible reasoning
L. Valiant (1979)
The Complexity of Computing the PermanentTheor. Comput. Sci., 8
Leila Amgoud, Srdjan Vesic (2011)
A new approach for preference-based argumentation frameworksAnnals of Mathematics and Artificial Intelligence, 63
Thomas Eiter, G. Gottlob (1997)
The Complexity Class Theta2p: Recent Results and Applications in AI and Modal Logic
Article A, Publication date: January YYYY. On the Complexity of Probabilistic Abstract Argumentation Frameworks A
R. Haenni, J. Kohlas, N. Lehmann (2003)
Probabilistic Argumentation SystemsJournal of Applied Logic, 1
Á. Fóthi, J. Nyéky-Gaizler, Z. Porkoláb
On the Complexity of Class
Hengfei Li, N. Oren, T. Norman (2013)
Relaxing independence assumptions in probabilistic argumentation
P. Dung (1995)
On the Acceptability of Arguments and its Fundamental Role in Nonmonotonic Reasoning, Logic Programming and n-Person GamesArtif. Intell., 77
A. Hunter (2013)
Modelling Uncertainty in Persuasion
(2015)
ACM Transactions on Computational Logic
A. Hunter (2012)
Some Foundations for Probabilistic Abstract Argumentation
Bart Verheij (1999)
Two Approaches to Dialectical Argumentation: Admissible Sets and Argumentation Stages
D. Martínez, A. García, Guillermo Simari (2008)
An Abstract Argumentation Framework with Varied-Strength Attacks
A. Hunter (2014)
Probabilistic qualification of attack in abstract argumentationInt. J. Approx. Reason., 55
S. Vadhan (2005)
Computational Complexity
(2006)
Semi-stable semantics. In Computational Models of Argument (COMMA)
Thomas Lukasiewicz (2011)
Probabilistic Deduction with Conditional Constraints over Basic Events
S. Coste-Marquis, C. Devred, P. Marquis (2005)
Prudent semantics for argumentation frameworks17th IEEE International Conference on Tools with Artificial Intelligence (ICTAI'05)
David Johnson, W. Freeman
The Np-completeness Column: an Ongoing Guide Garey and Myself in Our Book ''computers and Intractability: a Guide to the Theory of Np-completeness,''
T. Alsinet, C. Chesñevar, L. Godo, Guillermo Simari (2008)
A logic programming framework for possibilistic argumentation: Formalization and logical propertiesFuzzy Sets Syst., 159
Bettina Fazzinga, S. Flesca, F. Parisi (2013)
On the Complexity of Probabilistic Abstract Argumentation
T. Alsinet, C. Chesñevar, L. Godo, S. Sandri, Guillermo Simari (2008)
Formalizing argumentative reasoning in a possibilistic logic programming setting with fuzzy unificationInt. J. Approx. Reason., 48
Mauricio Osorio, J. Nieves (2009)
Possibilistic Well-Founded Semantics
(2009)
Assumption-Based Argumentation. See Rahwan and Simari
R. Haenni, B. Anrig, J. Kohlas, N. Lehmann (2001)
A Survey on Probabilistic Argumentation ∗
Leila Amgoud, H. Prade (2004)
Reaching Agreement Through Argumentation: A Possibilistic Approach
Seinosuke Toda, O. Watanabe (1992)
Polynomial Time 1-Turing Reductions from #PH to #PTheor. Comput. Sci., 100
P. Dunne, M. Wooldridge (2009)
Complexity of Abstract Argumentation
P. Dung, R. Kowalski, Francesca Toni (2009)
Assumption-Based Argumentation
W. Dvořák, S. Woltran (2010)
Complexity of semi-stable and stage semantics in argumentation frameworksInf. Process. Lett., 110
Davide Grossi, W. Hoek (2013)
Audience-Based Uncertainty in Abstract Argument Games
Dan Suciu (2009)
Probabilistic Databases
Hengfei Li, N. Oren, T. Norman (2011)
Probabilistic Argumentation Frameworks
W. Dvořák, M. Järvisalo, J. Wallner, S. Woltran (2012)
Complexity-sensitive decision procedures for abstract argumentationArtif. Intell., 206
Martin Caminada, W. Carnielli, P. Dunne (2006)
Semi-stable semantics
Lecture Notes in Computer Science
W. Dvořák (2012)
Computational Aspects of Abstract Argumentation
P. Dung, P. Thang (2010)
Towards (Probabilistic) Argumentation for Jury-based Dispute Resolution
Eun Kim, S. Ordyniak, Stefan Szeider (2010)
Algorithms and complexity results for persuasive argumentation
Leila Amgoud, C. Cayrol (2002)
A Reasoning Model Based on the Production of Acceptable ArgumentsAnnals of Mathematics and Artificial Intelligence, 34
P. Baroni, M. Giacomin, G. Guida (2005)
SCC-recursiveness: a general schema for argumentation semanticsArtif. Intell., 168
S. Flesca, F. Furfaro, F. Parisi (2013)
Consistency checking and querying in probabilistic databases under integrity constraintsJ. Comput. Syst. Sci., 80
Trevor Bench-Capon (2003)
Persuasion in Practical Argument Using Value-based Argumentation FrameworksJ. Log. Comput., 13
P. Besnard, A. Hunter (2007)
Elements of Argumentation
P. Baroni, M. Giacomin (2009)
Semantics of Abstract Argument Systems
Trevor Bench-Capon, P. Dunne (2007)
Argumentation in artificial intelligenceArtif. Intell., 171
P. Dung, P. Mancarella, Francesca Toni (2007)
Computing ideal sceptical argumentationArtif. Intell., 171
(2014)
Received May
P. Baroni, Martin Caminada, M. Giacomin (2011)
An introduction to argumentation semanticsThe Knowledge Engineering Review, 26
D. Poole (1997)
The Independent Choice Logic for Modelling Multiple Agents Under UncertaintyArtif. Intell., 94
Prof. Meinel, D. Theobald (1998)
Algorithms and Data Structures in VLSI Design
Andrea Ferrara, Guoqiang Pan, Moshe Vardi (2005)
Treewidth in Verification: Local vs. Global
Tjitze Rienstra (2012)
Towards a Probabilistic Dung-style Argumentation System
H. Prakken (2010)
An abstract framework for argumentation with structured argumentsArgument Comput., 1
J. Nieves, R. Confalonieri (2011)
A Possibilistic Argumentation Decision Making Framework with Default ReasoningFundam. Informaticae, 113
P. Dunne (2009)
The computational complexity of ideal semanticsArtif. Intell., 173
S. Modgil (2009)
Reasoning about preferences in argumentation frameworksArtif. Intell., 173
A. Hunter (2013)
A probabilistic approach to modelling uncertain logical argumentsInt. J. Approx. Reason., 54
Article 22, Publication date: May 2015. On the Complexity of Probabilistic Abstract Argumentation Frameworks
P. Dunne, A. Hunter, P. McBurney, S. Parsons, M. Wooldridge (2011)
Weighted argument systems: Basic definitions, algorithms, and complexity resultsArtif. Intell., 175
(2001)
A Survey on Probabilistic Argumentation Workshop: Adventures in Argumentation
Thomas Lukasiewicz (1998)
Probabilistic Logic Programming
S. Coste-Marquis, S. Konieczny, P. Marquis, Mohand Ouali (2012)
Weighted Attacks in Argumentation Frameworks
Probabilistic abstract argumentation combines Dungs abstract argumentation framework with probability theory in order to model uncertainty in argumentation. In this setting, we address the fundamental problem of computing the probability that a set of arguments is an extension according to a given semantics. We focus on the most popular semantics (i.e., admissible, stable, complete, grounded, preferred, ideal-set, ideal, stage, and semistable) and show the following dichotomy result: computing the probability that a set of arguments is an extension is either FP or FPP-complete depending on the semantics adopted. Our polynomial-time results are particularly interesting, as they hold for some semantics for which no polynomial-time technique was known so far.
ACM Transactions on Computational Logic (TOCL) – Association for Computing Machinery
Published: Jun 2, 2015
Keywords: Computational complexity
Read and print from thousands of top scholarly journals.
Already have an account? Log in
Bookmark this article. You can see your Bookmarks on your DeepDyve Library.
To save an article, log in first, or sign up for a DeepDyve account if you don’t already have one.
Copy and paste the desired citation format or use the link below to download a file formatted for EndNote
Access the full text.
Sign up today, get DeepDyve free for 14 days.
All DeepDyve websites use cookies to improve your online experience. They were placed on your computer when you launched this website. You can change your cookie settings through your browser.