Pages that link to "Item:Q656597"
From MaRDI portal
The following pages link to Complexity of semi-stable and stage semantics in argumentation frameworks (Q656597):
Displaying 23 items.
- On rejected arguments and implicit conflicts: the hidden power of argumentation semantics (Q334820) (← links)
- Complexity-sensitive decision procedures for abstract argumentation (Q490451) (← links)
- Weighted argument systems: basic definitions, algorithms, and complexity results (Q543610) (← links)
- Dynamics of argumentation systems: a division-based method (Q650522) (← links)
- Complexity of abstract argumentation under a claim-centric view (Q785236) (← links)
- Characteristics of multiple viewpoints in abstract argumentation (Q896434) (← links)
- On efficiently estimating the probability of extensions in abstract argumentation frameworks (Q899472) (← links)
- How does incoherence affect inconsistency-tolerant semantics for Datalog\(^\pm\)? (Q1653442) (← links)
- Towards fixed-parameter tractable algorithms for abstract argumentation (Q1761281) (← links)
- Augmenting tractable fragments of abstract argumentation (Q1761284) (← links)
- Graph-classes of argumentation frameworks with collective attacks (Q2055773) (← links)
- Shedding new light on the foundations of abstract argumentation: modularization and weak admissibility (Q2163881) (← links)
- Design and results of the second international competition on computational models of argumentation (Q2287197) (← links)
- Complexity of fundamental problems in probabilistic abstract argumentation: beyond independence (Q2321260) (← links)
- Methods for solving reasoning problems in abstract argumentation -- a survey (Q2341832) (← links)
- A QBF-based formalization of abstract argumentation semantics (Q2446545) (← links)
- Incremental Computation of Deterministic Extensions for Dynamic Argumentation Frameworks (Q2835878) (← links)
- On the Complexity of Probabilistic Abstract Argumentation Frameworks (Q2946762) (← links)
- Improved answer-set programming encodings for abstract argumentation (Q4592988) (← links)
- Range-based argumentation semantics as two-valued models (Q4593079) (← links)
- Paracoherent Answer Set Semantics meets Argumentation Frameworks (Q5108496) (← links)
- On the Decomposition of Abstract Dialectical Frameworks and the Complexity of Naive-based Semantics (Q5145833) (← links)
- The complexity landscape of claim-augmented argumentation frameworks (Q6099370) (← links)