Skip to main content

Advertisement

Springer Nature Link
Log in

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

  • Letter
  • Published:
Frontiers of Computer Science Aims and scope Submit manuscript

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

References

  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

    Article  MATH  Google Scholar 

  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

  5. Li A, Pan Y. Structural information and dynamical complexity of networks. IEEE Transactions on Information Theory, 2016, 62(6): 3290–3339

    Article  MATH  Google Scholar 

Download references

Acknowledgements

This work was supported by the National Natural Science Foundation of China (Grant Nos. 61762019 and 61862051), the Young Science and Technology Talent Growth Fund Project of Education Department of Guizhou Province (Qian Jiao He KY Zi[2017]343), the Science and Technology Foundation of Guizhou Province ([2019]1299), the Top-notch Talent Program of Guizhou province (KY[2018]080), the Industrial Technology Foundation of Qiannan State (Qiannan Ke He Gong Zi (2017) 16 Hao, [2017]10), the General program of Qiannan Normal University for Nationalities (qnsy2018016 and QNSYRC201715).

Author information

Authors and Affiliations

  1. College of Computer Science and Technology, Guizhou University, Guiyang, 550025, China

    Zaijun Zhang & Daoyun Xu

  2. Key Laboratory of Complex Systems and Intelligent Computing and School of Mathematics and Statistics, Qiannan Normal University for Nationalities, Duyun, 558000, China

    Zaijun Zhang & Jincheng Zhou

  3. School of Computer and Information, Qiannan Normal University for Nationalities, Duyun, 558000, China

    Jincheng Zhou

Authors
  1. Zaijun Zhang
    View author publications

    You can also search for this author inPubMed Google Scholar

  2. Daoyun Xu
    View author publications

    You can also search for this author inPubMed Google Scholar

  3. Jincheng Zhou
    View author publications

    You can also search for this author inPubMed Google Scholar

Corresponding author

Correspondence to Daoyun Xu.

Electronic supplementary material

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Zhang, Z., Xu, D. & Zhou, J. An algorithm for solving satisfiability problem based on the structural information of formulas. Front. Comput. Sci. 15, 156405 (2021). https://doi.org/10.1007/s11704-021-0318-8

Download citation

  • Received:

  • Accepted:

  • Published:

  • DOI: https://doi.org/10.1007/s11704-021-0318-8