Representing Abstract Dialectical Frameworks with Binary Decision Diagrams
This is the presentation of the accepted LPNMR (International Conference on Logic Programming and Non-monotonic Reasoning) paper, given at the
Research Seminar Logic and AI at Dresden.
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.
This talk will be given at the room APB 3027 and online via BigBlueButton.
Official Talk Announcement
The official announcement can be found here.