Algorithms and complexity results for persuasive argumentation
From MaRDI portal
Publication:646518
DOI10.1016/J.ARTINT.2011.03.001zbMATH Open1230.68189OpenAlexW1481052827MaRDI QIDQ646518
Eun Jung Kim, Sebastian Ordyniak, Stefan Szeider
Publication date: 17 November 2011
Published in: Artificial Intelligence (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.artint.2011.03.001
computational complexitygraphical modelsbounded treewidthabstract argumentationvalue-based argumentation frameworks
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- How to reason defeasibly
- Argumentation in artificial intelligence
- An abstract, argumentation-theoretic approach to default reasoning
- On the acceptability of arguments and its fundamental role in nonmonotonic reasoning, logic programming and \(n\)-person games
- Parametrized complexity theory.
- Persuasion in Practical Argument Using Value-based Argumentation Frameworks
- Computational properties of argument systems satisfying graph-theoretic constraints
- A sufficient condition for backtrack-bounded search
- Towards fixed-parameter tractable algorithms for abstract argumentation
- Bucket elimination: A unifying framework for reasoning
- Recursive conditioning
- Properties and Complexity of Some Formal Inter-agent Dialogues
- Bounded treewidth as a key to tractability of knowledge representation and reasoning
- Audiences in argumentation frameworks
- Logics in Artificial Intelligence
Cited In (9)
- Complexity of fundamental problems in probabilistic abstract argumentation: beyond independence
- Partial Semantics of Argumentation
- New width parameters for SAT and \#SAT
- On efficiently estimating the probability of extensions in abstract argumentation frameworks
- Algorithms for decision problems in argument systems under preferred semantics
- A comprehensive account of the burden of persuasion in abstract argumentation
- Title not available (Why is that?)
- Toward incremental computation of argumentation semantics: a decomposition-based approach
- On the Complexity of Probabilistic Abstract Argumentation Frameworks
Uses Software
This page was built for publication: Algorithms and complexity results for persuasive argumentation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q646518)
