Solving All-SAT Problems by P Systems

被引：5
|
作者：
Guo Ping [1 ,3 ]
Ji Jinfang [1 ]
Chen Haizhu [2 ]
Liu Ran [1 ]
机构：
[1] Chongqing Univ, Coll Comp Sci, Chongqing 400030, Peoples R China
[2] Chongqing Coll Elect Engn, Dept Software Engn, Chongqing 401331, Peoples R China
[3] Chongqing Key Lab Software Theory & Technol, Chongqing 400044, Peoples R China
来源：
CHINESE JOURNAL OF ELECTRONICS | 2015年 / 24卷 / 04期
基金：
美国国家科学基金会;
关键词：
All solutions for Satisfiability problem (All-SAT); Satisfiability problem (SAT problem); Conjunctive normal form (CNF); P system; Membrane computing; ACTIVE MEMBRANES;
D O I：
10.1049/cje.2015.10.013
中图分类号：
TM [电工技术]; TN [电子技术、通信技术];
学科分类号：
0808 ; 0809 ;
摘要：
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 time. Our work provides a new and effective solution to All-SAT in a distributed and parallel manner.
引用
收藏
页码：744 / 749
页数：6
相关论文
共 50 条
  • [1] Solving All-SAT Problems by P Systems
    GUO Ping
    JI Jinfang
    CHEN Haizhu
    LIU Ran
    Chinese Journal of Electronics, 2015, 24 (04) : 744 - 749
  • [2] All-SAT using Minimal Blocking Clauses
    Yu, Yinlei
    Subramanyan, Pramod
    Tsiskaridze, Nestan
    Malik, Sharad
    2014 27TH INTERNATIONAL CONFERENCE ON VLSI DESIGN AND 2014 13TH INTERNATIONAL CONFERENCE ON EMBEDDED SYSTEMS (VLSID 2014), 2014, : 86 - 91
  • [3] A Linear-Time Solution for All-SAT Problem Based on P System
    GUO Ping
    ZHU Jian
    CHEN Haizhu
    YANG Ruilong
    ChineseJournalofElectronics, 2018, 27 (02) : 367 - 373
  • [4] A Linear-Time Solution for All-SAT Problem Based on P System
    Guo Ping
    Zhu Jian
    Chen Haizhu
    Yang Ruilong
    CHINESE JOURNAL OF ELECTRONICS, 2018, 27 (02) : 367 - 373
  • [5] Accelerating All-SAT Computation with Short Blocking Clauses
    Zhang, Yueling
    Pu, Geguang
    Sun, Jun
    2020 35TH IEEE/ACM INTERNATIONAL CONFERENCE ON AUTOMATED SOFTWARE ENGINEERING (ASE 2020), 2020, : 6 - 17
  • [6] Hybrid BDD and All-SAT Method for Model Checking
    Yadgar, Avi
    Grumberg, Orna
    Schuster, Assaf
    LANGUAGES: FROM FORMAL TO NATURAL: ESSAYS DEDICATED TO NISSIM FRANCEZ ON THE OCCASION OF HIS 65TH BIRTHDAY, 2009, 5533 : 228 - 244
  • [7] Enhanced membrane computing algorithm of ALL-SAT problems based on the concept of full-length clauses
    Hao, Le
    Liu, Jun
    Chen, ShuWei
    DEVELOPMENTS OF ARTIFICIAL INTELLIGENCE TECHNOLOGIES IN COMPUTATION AND ROBOTICS, 2020, 12 : 261 - 268
  • [8] Solving subset sum and SAT problems by reaction systems
    Aman, Bogdan
    Ciobanu, Gabriel
    NATURAL COMPUTING, 2024, 23 (02) : 177 - 187
  • [9] Solving SAT with P systems with anti-membranes
    Aman, Bogdan
    JOURNAL OF MEMBRANE COMPUTING, 2023, 5 (02) : 100 - 107
  • [10] Solving SAT with P systems with anti-membranes
    Bogdan Aman
    Journal of Membrane Computing, 2023, 5 : 100 - 107
12345