No article text was recorded for this version.
computational complexity of argumentation
Version 2 of 248 papers55 conceptsfrozen 2026-10-04
Papers in this version
- Blog: Improved Answer-Set Programming Encodings for Abstract Argumentation
- Blog: On Undisputed Sets in Abstract Argumentation
- Blog: Complexity Results and Algorithms for Bipolar Argumentation
- Blog: Abstract Argumentation Frameworks - From Theoretical Insights to Practical Implications
- Blog: Recursion in Abstract Argumentation is Hard - On the Complexity of Semantics Based on Weak Admissibility
- Blog: Complexity of Abstract Argumentation under a Claim-Centric View
- Blog: Semantical and Computational Aspects of Horn
- Blog: Augmenting tractable fragments of abstract argumentation
- Blog: A Fully Rational Account of Structured Argumentation Under Resource Bounds
- Blog: Computing Argumentation in Polynomial Number of BDD Operations: A Preliminary Report
- Blog: Explaining preferences with argument positions
- Blog: Computational Argumentation: Reasoning, Dynamics, and Supporting Explainability
- Blog: A Lattice-Based Approach to Computing Warranted Beliefs in Skeptical Argumentation Frameworks
- Blog: Algorithms and Complexity Results for Persuasive Argumentation
- Blog: From Computational Argumentation to Explanation
- Blog: Bayesian Reasoning in an Abductive Mechanism for Argument Generation and Analysis
- Blog: Computing Preferred Extensions in Abstract Argumentation: a SAT-based Approach
- Blog: Decomposable negation normal form
- Blog: Argumentation Frameworks Features: an Initial Study
- Blog: On the Complexity of Enumerating the Extensions of Abstract Argumentation Frameworks
- Blog: Computing Argumentative Explanations in Bipolar Argumentation Frameworks
- Blog: Argumentation for Propositional Logic and Nonmonotonic Reasoning
- Blog: Augmenting Tractable Fragments of Abstract Argumentation
- Blog: Summary Report of The First International Competition on Computational Models of Argumentation
- Blog: Argumentation Ranking Semantics as a Feature for Classification - On Automatic Evaluation of Argumentative Essays
- Blog: Novel Algorithms for Abstract Dialectical Frameworks based on Complexity Analysis of Subclasses and SAT Solving
- Blog: Mechanisms for Opponent Modelling
- Blog: Semantical and Computational Aspects of Horn Approximations
- Blog: Probabilistic bipolar abstract argumentation frameworks: complexity results
- Blog: Computational Properties of Resolution-based Grounded Semantics
- Blog: Revisiting the Notion of Extension over Incomplete Abstract Argumentation Frameworks
- Blog: Bipolar Abstract Dialectical Frameworks Are Covered by Kleene's Three-valued Logic
- Blog: Argumentation Extensions Enumeration as a Constraint Satisfaction Problem: a Performance Overview
- Blog: Dynamics of Argumentation Systems: A Basic Theory
- Blog: Japanese Sentence Analysis as Argumentation
- Blog: Facets in Argumentation: A Formal Approach to Argument Significance
- Blog: Automata for infinite argumentation structures
- Blog: A Labeling Approach to the Computation of Credulous Acceptance in Argumentation
- Blog: Realizability of Three-Valued Semantics for Abstract Dialectical Frameworks
- Blog: Arguing and Explaining Classifications
- Blog: Deep Learning for Abstract Argumentation Semantics
- Blog: Independence and D-separation in Abstract Argumentation
- Blog: Argument-based Multi-Issue Negotiation
- Blog: The Complexity Landscape of Claim-Augmented Argumentation Frameworks
- Blog: Exploiting Parallelism for Hard Problems in Abstract Argumentation
- Blog: Tractable Abstract Argumentation via Backdoor-Treewidth
- Blog: Parameterized Complexity of Logic-Based Argumentation in Schaefer's Framework
- Blog: Foundations of Implementations for Formal Argumentation
History & citation
Current · Permanent link
Cite this direction
Latest version (a living page):
@misc{lacuna_computational_complexity_of_argumentatio_aa16934b,
title = {computational complexity of argumentation},
author = {{Lacuna}},
howpublished = {Lacuna research direction},
year = {2026},
url = {https://lacuna.tiptreesystems.com/direction/computational-complexity-of-argumentation/rdr_aa16934bcde149f29b56e17070512e4b},
note = {Latest version of a living research direction; cite a version for a fixed text. Accessed 2026-11-20},
}This exact version (version 2, frozen text):
@misc{lacuna_computational_complexity_of_argumentatio_aa16934b_v2,
title = {computational complexity of argumentation},
author = {{Lacuna}},
howpublished = {Lacuna research direction},
year = {2026},
url = {https://lacuna.tiptreesystems.com/direction/computational-complexity-of-argumentation/rdr_aa16934bcde149f29b56e17070512e4b/v/2},
note = {Version 2, frozen 2026-10-04. Accessed 2026-11-20},
}