|
|
|
An algorithm for solving satisfiability problem based on the structural information of formulas |
Zaijun ZHANG1,2, Daoyun XU1( ), Jincheng ZHOU2,3 |
1. College of Computer Science and Technology, Guizhou University, Guiyang 550025, China
2. Key Laboratory of Complex Systems and Intelligent Computing and School of Mathematics and Statistics, Qiannan Normal University for Nationalities, Duyun 558000, China
3. School of Computer and Information, Qiannan Normal University for Nationalities, Duyun 558000, China |
|
|
|
|
|
|
Corresponding Author(s):
Daoyun XU
|
|
Just Accepted Date: 16 March 2021
Issue Date: 24 August 2021
|
|
| 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
https://doi.org/10.1145/800157.805047
|
| 2 |
D A D Tompkins, A Balint, H H Hoos. 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
https://doi.org/10.1007/978-3-642-21581-0_24
|
| 3 |
S Cai, K Su. Local search for Boolean Satisfiability with configuration checking and subscore. Artificial Intelligence, 2013, 204(9): 75–98
https://doi.org/10.1016/j.artint.2013.09.001
|
| 4 |
A Balint, A Frohlich. 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
https://doi.org/10.1007/978-3-642-14186-7_3
|
| 5 |
A Li, Y Pan. Structural information and dynamical complexity of networks. IEEE Transactions on Information Theory, 2016, 62(6): 3290–3339
https://doi.org/10.1109/TIT.2016.2555904
|
|
Viewed |
|
|
|
Full text
|
|
|
|
|
Abstract
|
|
|
|
|
Cited |
|
|
|
|
| |
Shared |
|
|
|
|
| |
Discussed |
|
|
|
|
