资源分类
》 资源 》论文》Enumerating Potential Maximal Cliques via SAT and ASP

Enumerating Potential Maximal Cliques via SAT and ASP

2019-09-29 | |  76 |   40 |   0
Abstract The Bouchitte-Todinca algorithm (BT), operating ´ dynamic programming over the so-called potential maximal cliques (PMCs), yields a practically effi- cient approach to treewidth and generalized hypertreewidth. The enumeration of PMCs is a scalability bottleneck for BT in practice. We propose the use of declarative solvers for PMC enumeration as a substitute for the specialized PMC enumeration algorithms employed in current BT implementations. The presented Boolean satisfiability (SAT) and answer set programming (ASP) based PMC enumeration approaches open up new possibilities for improving the efficiency of BT in practice

上一篇：Entropy-Penalized Semidefinite Programming

下一篇：GANAK: A Scalable Probabilistic Exact Model Counter

用户评价
全部评价

热门资源

  • 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...