On the Relation Between Structured d-DNNFs and SDDs-Reference-Cited by-同舟云学术

On the Relation Between Structured d-DNNFs and SDDs

Published:2020-08-17 Issue:2 Volume:65 Page:274-295
ISSN:1432-4350
Container-title:Theory of Computing Systems
language:en
Short-container-title:Theory Comput Syst

Author:

Bollig Beate^ORCID,Farenholtz Martin

Abstract

AbstractStructured d-DNNFs and SDDs are restricted negation normal form circuits used in knowledge compilation as target languages into which propositional theories are compiled. Structuredness is imposed by so-called vtrees. By definition SDDs are restricted structured d-DNNFs. Beame and Liew (2015) as well as Bova and Szeider (2017) mentioned the question whether structured d-DNNFs are really more general than SDDs w.r.t. polynomial-size representations (w.r.t. the number of Boolean variables the represented functions are defined on.) The main result in the paper is the proof that a function can be represented by SDDs of polynomial size if the function and its complement have polynomial-size structured d-DNNFs that respect the same vtree.

Publisher

Springer Science and Business Media LLC

Subject

Computational Theory and Mathematics,Theoretical Computer Science

Link

https://link.springer.com/content/pdf/10.1007/s00224-020-10003-y.pdf

Reference24 articles.

1. Beame, P., Li, J., Roy, S., Suciu, D.: Lower bounds for exact model counting and applications in probabilistic databases. In: Proceedings of the Twenty-Ninth Conference on Uncertainty in Artificial Intelligence, UAI, pp. 157–162 (2013)

2. Beame, P., Liew, V.: New limits for knowledge compilation and applications to exact model counting. In: Proceedings of the Thirty-First Conference on Uncertainty in Artificial Intelligence, UAI, pp. 131–140 (2015)

3. Bollig, B., Buttkus, M.: On limitations of structured (deterministic) DNNFs. Theory of Computing Systems. https://doi.org/10.1007/s00224-019-09960-w (2019)

4. Bollig, B., Buttkus, M.: On the relative succinctness of sentential decision diagrams. Theory of Computing Systems 63(6), 1250–1277 (2019)

5. Bova, S.: SDDs are exponentially more succinct than OBDDs. In: Proceedings of the Thirtieth Conference on Artificial Intelligence, AAAI, pp. 929–935 (2016)

Cited by 3 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Breaking Symmetry for Knowledge Compilation;Proceedings of the 38th ACM/SIGAPP Symposium on Applied Computing;2023-03-27

2. An Abstract CNF-to-d-DNNF Compiler Based on Chronological CDCL;Frontiers of Combining Systems;2023

3. The Power of Disjoint Support Decompositions in Decision Diagrams;Lecture Notes in Computer Science;2022