Algorithms and complexity results for persuasive argumentation

DOI10.1016/j.artint.2011.03.001zbMath1230.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

zbMATH Keywords

computational complexitygraphical modelsbounded treewidthabstract argumentationvalue-based argumentation frameworks

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Logic in artificial intelligence (68T27)

Related Items (7)

Toward incremental computation of argumentation semantics: a decomposition-based approach ⋮ On the Complexity of Probabilistic Abstract Argumentation Frameworks ⋮ On efficiently estimating the probability of extensions in abstract argumentation frameworks ⋮ Algorithms for decision problems in argument systems under preferred semantics ⋮ New width parameters for SAT and \#SAT ⋮ Partial Semantics of Argumentation ⋮ Complexity of fundamental problems in probabilistic abstract argumentation: beyond independence

Uses Software

• OSCAR

Cites Work

• Audiences in argumentation frameworks
• Argumentation in artificial intelligence
• Computational properties of argument systems satisfying graph-theoretic constraints
• How to reason defeasibly
• An abstract, argumentation-theoretic approach to default reasoning
• Towards fixed-parameter tractable algorithms for abstract argumentation
• On the acceptability of arguments and its fundamental role in nonmonotonic reasoning, logic programming and \(n\)-person games
• Bucket elimination: A unifying framework for reasoning
• Bounded treewidth as a key to tractability of knowledge representation and reasoning
• Parametrized complexity theory.
• A sufficient condition for backtrack-bounded search
• Properties and Complexity of Some Formal Inter-agent Dialogues
• Persuasion in Practical Argument Using Value-based Argumentation Frameworks
• Logics in Artificial Intelligence
• Recursive conditioning
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Algorithms and complexity results for persuasive argumentation