资源分类
》 资源 》论文》A Structural Approach to Reasoning with Quantified Boolean Formulas

A Structural Approach to Reasoning with Quantified Boolean Formulas

2019-11-15 | |  88 |   65 |   0

Abstract In this paper we approach the problem of reasoning with quantifified Boolean formulas (QBFs) by combining search and resolution, and by switching between them according to structural properties of QBFs. We provide empirical evidence that QBFs which cannot be solved by search or resolution alone, can be solved by combining them, and that our approach makes a proof-of-concept implementation competitive with current QBF solvers

上一篇：A New d-DNNF-Based Bound Computation Algorithm for Functional E-MAJSAT

下一篇：Russian Doll Search with Tree Decomposition

用户评价
全部评价

热门资源

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