BAss: Symbolic Reasoning in Abstract Dialectical Frameworks
For researchers in systems biology and formal argumentation, BAss provides a practical symbolic reasoning tool that handles large solution spaces and enables new analyses in complex real-world applications.
BAss is a BDD-based symbolic solver for Abstract Dialectical Frameworks that computes all admissible, complete, and preferred interpretations, as well as two-valued and stable models. It dramatically outperforms previous BDD-based tools and is competitive with SAT/ASP-based methods, enabling enumeration of fixed points or minimal trap spaces in biological networks beyond the reach of existing tools.
We present BAss (BDD-based ADF symbolic solver), a novel analysis tool for Abstract Dialectical Frameworks (ADFs) based on Binary Decision Diagrams (BDDs). It supports the fully symbolic computation of all admissible, complete, and preferred interpretations, as well as two-valued and stable models of an ADFs. Our approach is inspired by the recently discovered equivalence between Boolean Networks (BNs) and ADFs by Heyninck et al. (2024) and Azpeitia et al. (2024), significantly extending current BDD-based tools bioLQM, AEON, and adf-bdd. We conducted experiments on a large-scale collection of real-world models from both the BN and ADF communities. Our results show that BAss dramatically outperforms previous BDD-based tools and is competitive (even significantly better in some cases) with state-of-the-art SAT/ASP-based methods, particularly in scenarios involving large solution spaces. Notably, BAss is able to enumerate all fixed points or minimal trap spaces of certain biological networks beyond the reach of existing tools, thereby enabling new analysis and case studies in systems biology. These results highlight the practical relevance of symbolic reasoning for complex real-world applications, particularly in systems biology and formal argumentation.