Pages that link to "Item:Q3532464"
From MaRDI portal
The following pages link to Computational Complexity of Semi-stable Semantics in Abstract Argumentation Frameworks (Q3532464):
Displaying 17 items.
- Complexity-sensitive decision procedures for abstract argumentation (Q490451) (← links)
- Theory of semi-instantiation in abstract argumentation (Q528522) (← links)
- Weighted argument systems: basic definitions, algorithms, and complexity results (Q543610) (← links)
- On the resolution-based family of abstract argumentation semantics and its grounded instance (Q543626) (← links)
- Complexity of semi-stable and stage semantics in argumentation frameworks (Q656597) (← links)
- Characteristics of multiple viewpoints in abstract argumentation (Q896434) (← links)
- On efficiently estimating the probability of extensions in abstract argumentation frameworks (Q899472) (← links)
- Computational properties of argument systems satisfying graph-theoretic constraints (Q1028949) (← links)
- A general semi-structured formalism for computational argumentation: definition, properties, and examples of application (Q1749391) (← links)
- Augmenting tractable fragments of abstract argumentation (Q1761284) (← links)
- Complexity of nonemptiness in control argumentation frameworks (Q2146008) (← 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)
- A Common Computational Framework for Semiring-based Argumentation Systems (Q2999123) (← links)
- Semi-stable semantics (Q3165758) (← links)
- Paracoherent Answer Set Semantics meets Argumentation Frameworks (Q5108496) (← links)
