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

作　　者：Zaijun ZHANG Daoyun XU Jincheng ZHOU 

机构地区：[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

出　　处：《Frontiers of Computer Science》2021年第6期191-193,共3页中国计算机科学前沿（英文版）

基　　金：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[2017J343),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).

摘　　要：1 Introduction The propositional satisfiability(SAT)problem is an important and prototypical NP-hard problem in theoretical computer science[1].Many efforts have been made for designing high-performance SAT solvers.The existing practical techniques for solving SAT problems are mainly divided into two categories:complete search technique and stochastic local search technique.

关 键 词：SATISFIABILITY TECHNIQUE COMPUTER 

分 类 号：TP34[自动化与计算机技术—计算机系统结构]