The following pages link to DIAMOND (Q33882):
Displayed 9 items.
- Analyzing the computational complexity of abstract dialectical frameworks via approximation fixpoint theory (Q898737) (← links)
- The first international competition on computational models of argumentation: results and analysis (Q1677447) (← links)
- Characterizing acceptability semantics of argumentation frameworks with recursive attack and support relations (Q1711894) (← links)
- Realizability of three-valued semantics for abstract dialectical frameworks (Q2287192) (← links)
- Design and results of the second international competition on computational models of argumentation (Q2287197) (← links)
- Understanding the Abstract Dialectical Framework (Q2835889) (← links)
- Solving Advanced Argumentation Problems with Answer Set Programming (Q4957200) (← links)
- On the Decomposition of Abstract Dialectical Frameworks and the Complexity of Naive-based Semantics (Q5145833) (← links)
- A Glimpse on Gerhard Brewka’s Contributions to Artificial Intelligence (Q5172603) (← links)