资源分类
》 资源 》论文》A Top-Down Compiler for Sentential Decision Diagrams

A Top-Down Compiler for Sentential Decision Diagrams

2019-11-19 | |  64 |   45 |   0
Abstract The sentential decision diagram (SDD) has been recently proposed as a new tractable representation of Boolean functions that generalizes the influential ordered binary decision diagram (OBDD). Empirically, compiling CNFs into SDDs has yielded significant improvements in both time and space over compiling them into OBDDs, using a bottomup compilation approach. In this work, we present a top-down CNF to SDD compiler that is based on techniques from the SAT literature. We compare the presented compiler empirically to the state-ofthe-art, bottom-up SDD compiler, showing ordersof-magnitude improvements in compilation time.

上一篇：Kernel Contraction and Base Dependence: Redundancy in the Base Resulting in Different Types of Dependence

下一篇：On the Parameterized Complexity of Belief Revision

用户评价
全部评价

热门资源

  • The Variational S...

    Unlike traditional images which do not offer in...

  • Learning to Predi...

    Much of model-based reinforcement learning invo...

  • Stratified Strate...

    In this paper we introduce Stratified Strategy ...

  • A Mathematical Mo...

    Direct democracy, where each voter casts one vo...

  • Rating-Boosted La...

    The performance of a recommendation system reli...