On the relation between structured d-DNNFs and SDDs
From MaRDI portal
Publication:2035477
DOI10.1007/S00224-020-10003-YOpenAlexW3075905141MaRDI QIDQ2035477FDOQ2035477
Authors: Beate Bollig, Martin Farenholtz 
Publication date: 24 June 2021
Published in: Theory of Computing Systems (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1912.01430
Recommendations
complexity theoryknowledge compilationdecomposable negation normal formssentential decision diagrams
Cites Work
- Branching Programs and Binary Decision Diagrams
- Title not available (Why is that?)
- On the Tractable Counting of Theory Models and its Application to Truth Maintenance and Belief Revision
- On the complexity of VLSI implementations and graph representations of Boolean functions with application to integer multiplication
- Title not available (Why is that?)
- Decomposable negation normal form
- Top-down algorithms for constructing structured DNNF: theoretical and practical implications
- On the relative succinctness of sentential decision diagrams
- On limitations of structured (deterministic) DNNFs
- On compiling structured CNFs to OBDDs
Cited In (5)
- On the relative succinctness of sentential decision diagrams
- Top-down algorithms for constructing structured DNNF: theoretical and practical implications
- On limitations of structured (deterministic) DNNFs
- An Abstract CNF-to-d-DNNF Compiler Based on Chronological CDCL
- DAG-\( \Sigma \): a DAG-based sigma protocol for relations in CNF
This page was built for publication: On the relation between structured \(d\)-DNNFs and SDDs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2035477)
