We address the problem of efficient generation of structured argumentation systems. We consider a simplified variant of an ASPIC argumentation system and provide a backward chaining mechanism for the generation of structured argumentation graphs. We empirically compare the efficiency of this new approach with existing approaches (based on forward chaining) and characterise the benefits of using backward chaining for argumentation-based query answering.
|Name||Frontiers in Artificial Intelligence and Applications|
|Conference||Computational Models of Argument |
|Period||4/09/20 → 11/09/20|
- Backward chaining