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 Dialectical Frameworks (ADF) are a generalisation of Dung’s Argumentation frameworks. Multiple approaches for reasoning under various semantics have been proposed over the last decade. 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 publicationComputational Models of Argument - Proceedings of COMMA 2022
EditorsFrancesca Toni, Sylwia Polberg, Richard Booth, Martin Caminada, Hiroyuki Kido
Number of pages2
ISBN (Electronic)9781643683065
Publication statusPublished - 2022
Event9th International Conference on Computational Models of Argument: COMMA 2022 - Cardiff, United Kingdom
Duration: 14 Sept 202216 Sept 2022

Publication series

NameFrontiers in Artificial Intelligence and Applications
PublisherIOS Press


Conference9th International Conference on Computational Models of Argument
Abbreviated titleCOMMA 2022
Country/TerritoryUnited Kingdom
Internet address


  • abstract dialectical frameworks
  • binary decision diagrams
  • rust-lang

ASJC Scopus subject areas

  • Artificial Intelligence


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

Cite this