Razgon, Igor (2014) On OBDDs for CNFs of bounded treewidth. In: Baral, C. and De Giacomo, G. and Eiter, T. (eds.) Fourteenth International Conference on the Principles of Knowledge Representation and Reasoning. Palo Alto, U.S.: AAAI Press. ISBN 9781577356578.
|
Text
15411.pdf - Author's Accepted Manuscript Download (425kB) | Preview |
Abstract
In this paper we show that a CNF cannot be compiled into an Ordered Binary Decision Diagram (OBDD) of fixed-parameter size parameterized by the primal graph treewidth of the input CNF. Thus we provide a parameterized separation between OBDDs and Sentential Decision Diagrams for which such fixed-parameter compilation is possible. We also show that the best existing parameterized upper bound for OBDDs in fact holds for the incidence graph treewidth parameterization.
Metadata
| Item Type: | Book Section |
|---|---|
| Additional Information: | Vienna, Austria, July 20–24, 2014. |
| Keyword(s) / Subject(s): | Treewidth, OBDD |
| School: | Birkbeck Faculties and Schools > Faculty of Science > School of Computing and Mathematical Sciences |
| Depositing User: | Administrator |
| Date Deposited: | 03 Jun 2016 10:24 |
| Last Modified: | 29 Jul 2025 13:43 |
| URI: | https://eprints.bbk.ac.uk/id/eprint/15411 |
Statistics
Additional statistics are available via IRStats2.
Archive Staff Only (login required)
