Pages that link to "Item:Q898737"
From MaRDI portal
The following pages link to Analyzing the computational complexity of abstract dialectical frameworks via approximation fixpoint theory (Q898737):
Displaying 13 items.
- Advanced algorithms for abstract dialectical frameworks based on complexity analysis of subclasses and SAT solving (Q2124467) (← links)
- Epistemic graphs for representing and reasoning with positive and negative influences of arguments (Q2303513) (← links)
- Representing abstract dialectical frameworks with binary decision diagrams (Q2694565) (← links)
- Understanding the Abstract Dialectical Framework (Q2835889) (← links)
- Probabilistic Abstract Dialectical Frameworks (Q2938525) (← links)
- Solving Advanced Argumentation Problems with Answer Set Programming (Q4957200) (← links)
- Admissibility in Probabilistic Argumentation (Q5094045) (← 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)
- On Well-Founded Set-Inductions and Locally Monotone Operators (Q5278197) (← links)
- On acceptance conditions in abstract argumentation frameworks (Q6494661) (← links)
- Categorical approximation fixpoint theory (Q6545560) (← links)
- Non-deterministic approximation fixpoint theory and its application in disjunctive logic programming (Q6566627) (← links)
