Representing abstract dialectical frameworks with binary decision diagrams

DOI10.1007/978-3-031-15707-3_14OpenAlexW4293179678MaRDI QIDQ2694565

Dominik Rusovac, Sarah A. Gaggl, Stefan Ellmauthaler, Johannes Peter Wallner

Publication date: 4 April 2023

Full work available at URL: https://doi.org/10.1007/978-3-031-15707-3_14

zbMATH Keywords

binary decision diagramsabstract dialectical frameworks

Mathematics Subject Classification ID

Cellular automata (computational aspects) (68Q80)

Cites Work

• Analyzing the computational complexity of abstract dialectical frameworks via approximation fixpoint theory
• On the acceptability of arguments and its fundamental role in nonmonotonic reasoning, logic programming and \(n\)-person games
• Advanced algorithms for abstract dialectical frameworks based on complexity analysis of subclasses and SAT solving
• AEON: attractor bifurcation analysis of parametrised Boolean networks
• Graph-Based Algorithms for Boolean Function Manipulation
• Improving the variable ordering of OBDDs is NP-complete
• Instantiating rule-based defeasible theories in abstract dialectical frameworks and beyond
• Solving Advanced Argumentation Problems with Answer Set Programming
• On the Decomposition of Abstract Dialectical Frameworks and the Complexity of Naive-based Semantics
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Representing abstract dialectical frameworks with binary decision diagrams