Abstract Dialectical Frameworks solved with Binary Decision Diagrams
- Contact Stefan Ellmauthaler
- Publication date April 22, 2022
Abstract Dialectical Frameworks (ADF) are a generalisation of Dung’s Argumentation frameworks. “Abstract Dialectical Frameworks solved by Binary Decision Diagrams, developed in Dresden” ( ADF -BDD) is a novel approach that relies on the translation of the acceptance conditions of a given ADF into reduced ordered binary decision diagrams (roBDD). Our system is based on the consideration that many otherwise hard to decide problems in ADF semantics (e. g., answering SAT-questions) can be solved in polynomial time on roBDDs. Our novel approach differs to the currently used systems, like the SAT-based approaches or the wide spectrum of answer set programming (ASP) focused approaches. ADF -BDD is written in RUST to provide good performance while enforcing a high amount of memory- and type-safety. In addition the rust-compiler produces highly optimised machine code, while keeping the whole tech stack simple.
ADF - BDD : An ADF Solver Based on Binary Decision Diagrams
In Francesca Toni, eds., Proceedings of the 9th International Conference on Computational Models of Argument (COMMA 2022), volume 220146 of FAIA, 355-356, September 2022. IOS Press
Representing Abstract Dialectical Frameworks with Binary Decision Diagrams
In G. Gottlob, D Inclezan, M. Maratea, eds., Proceedings of the 16th International Conference on Logic Programming and Non-monotonic Reasoning (LPNMR 2022), volume 13416 of Lecture Notes in Computer Science, 177-198, 2022. Springer