人工知能学会全国大会論文集
Online ISSN : 2758-7347
31st (2017)
セッションID: 1M2-OS-02b-2
会議情報

Boost SAT solver with hybrid branching heuristic
*ムン ソンス稲葉 真理
著者情報
会議録・要旨集 フリー

詳細
抄録

Most state-of-the-art SAT solvers use VSIDS as their branching heuristic because of its robustness. However, in general, a branching heuristic can not cover all problems. It is axiomatic that mixture of branching heuristic with adequate configuration performs better than single branching heuristic. In this paper, we propose hybrid branching heuristic and show some preliminary experimental results using benchmarks from SAT competitions to evaluate its efficiency.

著者関連情報
© 2017 The Japanese Society for Artificial Intelligence
前の記事 次の記事
feedback
Top