The complexity landscape of claim-augmented argumentation frameworks

Related Items (1)

A claim-centric perspective on abstract argumentation semantics: claim-defeat, principles, and expressiveness

Cites Work

Complexity-sensitive decision procedures for abstract argumentation
Instantiating abstract argumentation with classical logic arguments: postulates and properties
Complexity of semi-stable and stage semantics in argumentation frameworks
Graph theoretical structures in logic programs and default theories
Complexity of abstract argumentation under a claim-centric view
Computational properties of argument systems satisfying graph-theoretic constraints
An abstract, argumentation-theoretic approach to default reasoning
Towards fixed-parameter tractable algorithms for abstract argumentation
Augmenting tractable fragments of abstract argumentation
Coherence in finite argument systems.
On the acceptability of arguments and its fundamental role in nonmonotonic reasoning, logic programming and \(n\)-person games
Acceptance in incomplete argumentation frameworks
Methods for solving reasoning problems in abstract argumentation -- a survey
On the equivalence between logic programming semantics and argumentation semantics
Rich preference-based argumentation frameworks
Enhancing Statement Evaluation in Argumentation via Multi-labelling Systems
Preference in Abstract Argumentation
Computational Complexity
Complexity Results and Algorithms for Extension Enforcement in Abstract Argumentation
Symbolic and Quantitative Approaches to Reasoning with Uncertainty
Parameterized Algorithms
A sharp threshold for the phase transition of a restricted satisfiability problem for Horn clauses
Unnamed Item
Unnamed Item
Unnamed Item

This page was built for publication: The complexity landscape of claim-augmented argumentation frameworks