资源分类
》 资源 》论文》An Exact Inference Scheme for MinSAT

An Exact Inference Scheme for MinSAT

2019-11-19 | |  64 |   47 |   0
Abstract We describe an exact inference-based algorithm for the MinSAT problem. Given a multiset of clauses ?, the algorithm derives as many empty clauses as the maximum number of clauses that can be falsified in ? by applying finitely many times an inference rule, and returns an optimal assignment. We prove the correctness of the algorithm, describe how it can be extended to deal with weighted MinSAT and weighted partial MinSAT instances, analyze the differences between the MaxSAT and MinSAT inference schemes, and define and empirically evaluate the MinSAT Pure Literal Rule.

上一篇：A Modularity-Based Random SAT Instances Generator

下一篇：Prime Compilation of Non-Clausal Formulae

用户评价
全部评价

热门资源

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