Razgon, Igor and Petke, J. (2013) Cliquewidth and knowledge compilation. In: Järvisalo, M. and Van Gelder, A. (eds.) Theory and Applications of Satisfiability Testing. Lecture Notes in Computer Science 7962. Berlin, Germany: Springer Verlag, pp. 335-350. ISBN 9783642390715.
|
Text
7913.pdf - Author's Accepted Manuscript Download (342kB) | Preview |
Abstract
In this paper we study the role of cliquewidth in succinct representation of Boolean functions. Our main statement is the following: Let Z be a Boolean circuit having cliquewidth k. Then there is another circuit Z * computing the same function as Z having treewidth at most 18k + 2 and which has at most 4|Z| gates where |Z| is the number of gates of Z. In this sense, cliquewidth is not more ‘powerful’ than treewidth for the purpose of representation of Boolean functions. We believe this is quite a surprising fact because it contrasts the situation with graphs where an upper bound on the treewidth implies an upper bound on the cliquewidth but not vice versa. We demonstrate the usefulness of the new theorem for knowledge compilation. In particular, we show that a circuit Z of cliquewidth k can be compiled into a Decomposable Negation Normal Form (dnnf) of size O(918k k 2|Z|) and the same runtime. To the best of our knowledge, this is the first result on efficient knowledge compilation parameterized by cliquewidth of a Boolean circuit.
Metadata
| Item Type: | Book Section |
|---|---|
| Additional Information: | 16th International Conference, Helsinki, Finland, July 8-12, 2013. Proceedings. Series ISSN: 0302-9743. The final publication is available at Springer via the link above. |
| School: | Birkbeck Faculties and Schools > Faculty of Science > School of Computing and Mathematical Sciences |
| Depositing User: | Sarah Hall |
| Date Deposited: | 01 Aug 2013 14:52 |
| Last Modified: | 09 Aug 2025 17:51 |
| URI: | https://eprints.bbk.ac.uk/id/eprint/7913 |
Statistics
Additional statistics are available via IRStats2.
Archive Staff Only (login required)
