تقرير
On the relation between structured $d$-DNNFs and SDDs
| العنوان: | On the relation between structured $d$-DNNFs and SDDs |
|---|---|
| المؤلفون: | Bollig, Beate, Farenholtz, Martin |
| سنة النشر: | 2019 |
| المجموعة: | Computer Science |
| مصطلحات موضوعية: | Computer Science - Computational Complexity, Computer Science - Artificial Intelligence, Computational Complexity (cs.CC), Artificial Intelligence (cs.AI), F.1.3, I.2 |
| الوصف: | Structured $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. Comment: 16 pages. The main result of the paper generalizes one of the results from paper arXiv:1802.04544 where unambiguous nondeterministic OBDDs are considered which can be seen as restricted structured $d$-DNNFs |
| نوع الوثيقة: | Working Paper |
| URL الوصول: | http://arxiv.org/abs/1912.01430 |
| رقم الأكسشن: | edsarx.1912.01430 |
| قاعدة البيانات: | arXiv |
| الوصف غير متاح. |