资源分类
》 资源 》论文》SDD: A New Canonical Representation of Propositional Knowledge Bases

SDD: A New Canonical Representation of Propositional Knowledge Bases

2019-11-12 | |  50 |   43 |   0
Abstract We identify a new representation of propositional knowledge bases, the Sentential Decision Diagram (SDD), which is interesting for a number of reasons. First, it is canonical in the presence of additional properties that resemble reduction rules of OBDDs. Second, SDDs can be combined using any Boolean operator in polytime. Third, CNFs with n variables and treewidth w have canonical SDDs of size O(n2w ), which is tighter than the bound on OBDDs based on pathwidth. Finally, every OBDD is an SDD. Hence, working with the latter does not preclude the former.

上一篇：Defeasible Inheritance-Based Description Logics Giovanni Casini Umberto Straccia

下一篇：Ef?cient Reasoning in Proper Knowledge Bases with Unknown Individuals Giuseppe De Giacomo Yves Lespe?rance Hector J. Levesque

用户评价
全部评价

热门资源

  • Learning to Predi...

    Much of model-based reinforcement learning invo...

  • Stratified Strate...

    In this paper we introduce Stratified Strategy ...

  • The Variational S...

    Unlike traditional images which do not offer in...

  • A Mathematical Mo...

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

  • Rating-Boosted La...

    The performance of a recommendation system reli...