Abstract Dialectical Frameworks solved with Binary Decision Diagrams
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.