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... 

【文章頁數(shù)】：6 頁

【參考文獻(xiàn)】：
期刊論文
[1]求解SAT問題的擬人退火算法[J]. 張德富,黃文奇,汪厚祥.  計(jì)算機(jī)學(xué)報(bào). 2002(02)
[2]Solving SAT by Algorithm Transform of Wu’s Method[J]. 賀思敏,張鈸.  Journal of Computer Science and Technology. 1999(05)



本文編號：3670727