Solving All-SAT Problems by P Systems
Solving All-SAT Problems by P Systems作者机构：College of Computer Science Chongqing University Chongqing Key Laboratory of Software Theory & Technology Department of Software Engineering Chongqing College of Electronic Engineering
出 版 物：《Chinese Journal of Electronics》 (电子学报(英文))
年 卷 期：2015年第24卷第4期
页 面：744-749页
核心收录：
学科分类：08[工学] 081201[工学-计算机系统结构] 0812[工学-计算机科学与技术（可授工学、理学学位）]
基 金：supported by the National Science Foundation for Young Scholars of China(No.61201347) the Natural Science Foundation Project of CQ CSTC(No.2012jj A40022,No.2011jj A40027,No.2012jj A40011) the Fundamental Research Funds for the Central Universities(No.CDJZR12180002)
主 题：All solutions for Satisfiability problem(All-SAT) Satisfiability problem(SAT problem) Conjunctive normal form(CNF) P system Memb
摘 要：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 of P systems to solve All-SAT in polynomial *** work provides a new and effective solution to All-SAT in a distributed and parallel manner.
同方期刊数据库