Representing Abstract Dialectical Frameworks with Binary Decision Diagrams

Stefan Ellmauthaler, Sarah A. Gaggl, Dominik Rusovac, Johannes Peter Wallner

Publikation: Beitrag in Buch/Bericht/KonferenzbandBeitrag in einem KonferenzbandBegutachtung

Abstract

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.
Originalspracheenglisch
TitelProceedings LPNMR
Herausgeber (Verlag)Springer
Seiten177-189
Band13416
DOIs
PublikationsstatusVeröffentlicht - 2022
Veranstaltung16th International Conference on Logic Programming and Non-monotonic Reasoning: LPNMR 2022 - Genova, Italien
Dauer: 5 Sep. 20228 Sep. 2022
https://sites.google.com/view/lpnmr2022

Publikationsreihe

NameLecture Notes in Computer Science
Herausgeber (Verlag)Springer
ISSN (elektronisch)1611-3349

Konferenz

Konferenz16th International Conference on Logic Programming and Non-monotonic Reasoning
KurztitelLPNMR 2022
Land/GebietItalien
OrtGenova
Zeitraum5/09/228/09/22
Internetadresse

Fingerprint

Untersuchen Sie die Forschungsthemen von „Representing Abstract Dialectical Frameworks with Binary Decision Diagrams“. Zusammen bilden sie einen einzigartigen Fingerprint.

Dieses zitieren