ADF-BDD: An ADF Solver Based on Binary Decision Diagrams

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

Research output: Chapter in Book/Report/Conference proceedingConference paperpeer-review

Abstract

Abstract Dialectical Frameworks (ADF) are a generalisation of Dung’s Argumentation frameworks [2]. Multiple approaches for reasoning under various semantics have been proposed over the last decade [3,4,5,6]. We present “Abstract Dialectical Frameworks solved by Binary Decision Diagrams, developed in Dresden” (ADF - BDD) a novel approach that relies on the translation of the acceptance conditions of a given ADF into reduced ordered binary decision diagrams (roBDD)
Original languageEnglish
Title of host publicationProceedings COMMA
Publication statusAccepted/In press - 2022
Event9th International Conference on Computational Models of Argument: COMMA 2022 - Cardiff, United Kingdom
Duration: 14 Sep 202216 Sep 2022
https://comma22.cs.cf.ac.uk/

Conference

Conference9th International Conference on Computational Models of Argument
Abbreviated titleCOMMA 2022
Country/TerritoryUnited Kingdom
CityCardiff
Period14/09/2216/09/22
Internet address

Fingerprint

Dive into the research topics of 'ADF-BDD: An ADF Solver Based on Binary Decision Diagrams'. Together they form a unique fingerprint.

Cite this