Pages that link to "Item:Q1852857"
From MaRDI portal
The following pages link to On the computational complexity of assumption-based argumentation for default reasoning. (Q1852857):
Displayed 4 items.
- Two party immediate response disputes: Properties and efficiency (Q814510) (← links)
- Dialectic proof procedures for assumption-based, admissible argumentation (Q2457643) (← links)
- Assumption-Based Argumentation for Selection and Composition of Services (Q3602953) (← links)
- Algorithms for Effective Argumentation in Classical Propositional Logic: A Connection Graph Approach (Q5445306) (← links)