Representing abstract dialectical frameworks with binary decision diagrams

DOI10.1007/978-3-031-15707-3_14MaRDI QIDQ2694565zbMATH OpenOpenAlexFDO

Authors Stefan Ellmauthaler, Sarah Alice Gaggl, Dominik Rusovac, Johannes Wallner

Publication date 4 April 2023

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

zbMATH Keywords

abstract dialectical frameworksbinary decision diagrams

Mathematics Subject Classification ID

Cellular automata (computational aspects) (68Q80)

Cites work

• Advanced algorithms for abstract dialectical frameworks based on complexity analysis of subclasses and SAT solving
• AEON: attractor bifurcation analysis of parametrised Boolean networks
• Analyzing the computational complexity of abstract dialectical frameworks via approximation fixpoint theory
• Graph-Based Algorithms for Boolean Function Manipulation
• scientific article; zbMATH DE number 1946853 (Why is no real title available?)
• scientific article; zbMATH DE number 6934384 (Why is no real title available?)
• scientific article; zbMATH DE number 1368933 (Why is no real title available?)
• Improving the variable ordering of OBDDs is NP-complete
• Instantiating rule-based defeasible theories in abstract dialectical frameworks and beyond
• On the acceptability of arguments and its fundamental role in nonmonotonic reasoning, logic programming and n-person games
• On the decomposition of abstract dialectical frameworks and the complexity of naive-based semantics
• Solving Advanced Argumentation Problems with Answer Set Programming

Cited in

(1)

• scientific article; zbMATH DE number 7166765 (Why is no real title available?)

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2694565)