An algorithm for solving satisfiability problem based on the structural information of formulas

Zaijun ZHANG; Daoyun XU; Jincheng ZHOU

doi:10.1007/s11704-021-0318-8

Front. Comput. Sci. ›› 2021, Vol. 15 ›› Issue (6) : 156405 DOI: 10.1007/s11704-021-0318-8

LETTER

An algorithm for solving satisfiability problem based on the structural information of formulas

Zaijun ZHANG ¹^,²
, Daoyun XU ¹^,^†
, Jincheng ZHOU ²^,³

Author information +

History +

PDF (318KB)

Cite this article

Download citation ▾

Zaijun ZHANG, Daoyun XU, Jincheng ZHOU. An algorithm for solving satisfiability problem based on the structural information of formulas. Front. Comput. Sci., 2021, 15(6): 156405 DOI:10.1007/s11704-021-0318-8

登录浏览全文

4963

注册一个新账户忘记密码

References

Publishing order | Descend order by publishing year | Descend order by cited within

[1]	Cook S A. The complexity of theorem-proving procedures. In: Proceedings of the 3rd Annual ACM Symposium on Theory of Computing. 1971, 151–158

[2]	Tompkins D A D, Balint A, Hoos H H. Captain Jack: new variable selection heuristics in local search for SAT. In: Proceedings of the 14th International Conference on Theory and Application of Satisfiability Testing. 2011, 302–316

[3]	Cai S, Su K. Local search for Boolean Satisfiability with configuration checking and subscore. Artificial Intelligence, 2013, 204(9): 75–98

[4]	Balint A, Frohlich A. Improving stochastic local search for SAT with a new probability distribution. In: Proceedings of International Conference on Theory and Applications of Satisfiability Testing. 2010, 10–15