Representing Abstract Dialectical Frameworks with Binary Decision Diagrams

Talk by Stefan Ellmauthaler

Location: APB room 3027
Start: 1. September 2022 at 11:00 am
End: 1. September 2022 at 11:30 am
Event series: Research Seminar Logic and AI
iCal

Abstract dialectical frameworks (ADFs) are a well-studied generalisation of the prominent argumentation frameworks due to Phan Minh Dung. In this paper we propose to use reduced ordered binary decision diagrams (roBDDs) as a suitable representation of the acceptance conditions of arguments within ADFs. We first show that computational complexity of reasoning on ADFs represented by roBDDs is milder than in the general case, with a drop of one level in the polynomial hierarchy. Furthermore, we present a framework to systematically define heuristics for search space exploitation, based on easily retrievable properties of roBDDs and the recently proposed approach of weighted faceted navigation for answer set programming. Finally, we present preliminary experiments of an implementation of our approach showing promise both when compared to state-of-the-art solvers and when developing heuristics for reasoning.

The talk will take place in a hybrid fashion, physically in the seminar room, and online through the link:

https://bbb.tu-dresden.de/b/ali-zgz-l8d-52n