Pages that link to "Item:Q5009697"
From MaRDI portal
The following pages link to Declarative Algorithms and Complexity Results for Assumption-Based Argumentation (Q5009697):
Displaying 8 items.
- Complexity-sensitive decision procedures for abstract argumentation (Q490451) (← links)
- Computational properties of argument systems satisfying graph-theoretic constraints (Q1028949) (← links)
- On the computational complexity of assumption-based argumentation for default reasoning. (Q1852857) (← links)
- Automata, Languages and Programming (Q5716769) (← links)
- Harnessing Incremental Answer Set Solving for Reasoning in Assumption-Based Argumentation (Q6063862) (← links)
- A general framework for preferences in answer set programming (Q6067052) (← links)
- Reasoning in assumption-based argumentation using tree-decompositions (Q6545531) (← links)
- Constrained derivation in assumption-based argumentation (Q6630208) (← links)