基于子句长度的分支策略

Branching Strategy Based On Clause Length

研究SAT问题不仅具有重要的理论意义,而且具有实际应用价值。设计高效的SAT问题的算法是国内外研究的热点。而分支策略是影响求解算法关键因素之一,目前大多数分支策略都是基于VSIDS策略提出的,虽然存在很多分支策略,但仍不能满足实际需要。为此,针对求解SAT问题实例会中出现子句长度不一致的情况,提出一种新的分支策略,基于子句长度的分支策略(BSBCL),并通过实验验证其有效性。

Studying the SAT problem not only has important theoretical significance but also has practical application value. The algorithm for designing efficient SAT problem is a hot topic at home and abroad. Branching strategy is one of the key factors affecting the solution algorithm. At present,most branching strategies are based on the VSIDS strategy. Although there are many branching strategies,they still cannot meet the actual needs. In this paper,a new branching strategy based on clause length branching strategy( BSBCL) is proposed to solve the problem of inconsistent clause length in the solution of SAT problem,and verify its effectiveness through experiments.