Solving All-SAT Problems by P Systems

发布时间：2022-08-07 17:18

　　The satisfiability problem（SAT） is a well known NP-complete problem. Obtaining All of the truth assignments of SAT is called All-SAT and it has numerous applications in artificial intelligence and computer theories. Many algorithms about SAT have been built, but how to solve All-SAT is still difficult. P system is a new distributed and parallel computation model. We use membrane division, which is frequently investigated to obtain an exponential working space in a linear time, to design a family... 

【文章页数】：6 页

【参考文献】：
期刊论文
[1]求解SAT问题的拟人退火算法[J]. 张德富,黄文奇,汪厚祥.  计算机学报. 2002(02)
[2]Solving SAT by Algorithm Transform of Wu’s Method[J]. 贺思敏,张钹.  Journal of Computer Science and Technology. 1999(05)



本文编号：3670727