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

Aus International Center for Computational Logic
Wechseln zu:Navigation, Suche

Toggle side column

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

Stefan EllmauthalerStefan Ellmauthaler,  Sarah Alice GagglSarah Alice Gaggl,  Dominik RusovacDominik Rusovac,  Johannes P. WallnerJohannes P. Wallner
Stefan Ellmauthaler, Sarah Alice Gaggl, Dominik Rusovac, Johannes P. Wallner
ADF - BDD : An ADF Solver Based on Binary Decision Diagrams
Proceedings of the 9th International Conference on Computational Models of Argument (COMMA 2022), to appear
  • KurzfassungAbstract
    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).
  • Projekt:Project: CPECNAVASScaDS.AI
  • Verknüpfte Tools:Related Tools: adf-bdd
  • Forschungsgruppe:Research Group: Logische Programmierung und ArgumentationWissensbasierte Systeme
@inproceedings{EGRW2022,
  author    = {Stefan Ellmauthaler and Sarah Alice Gaggl and Dominik Rusovac and
               Johannes P. Wallner},
  title     = {ADF - {BDD} : An {ADF} Solver Based on Binary Decision Diagrams},
  booktitle = {Proceedings of the 9th International Conference on Computational
               Models of Argument (COMMA 2022)},
  year      = {2022}
}