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 条
  • [31] Solving constraint satisfaction problems with SAT modulo theories
    Bofill, Miquel
    Palahi, Miquel
    Suy, Josep
    Villaret, Mateu
    CONSTRAINTS, 2012, 17 (03) : 273 - 303
  • [32] Solving SAT and HPP with accepting splicing systems
    Loos, Remco
    Martin-Vide, Carlos
    Mitrana, Victor
    PARALLEL PROBLEM SOLVING FROM NATURE - PPSN IX, PROCEEDINGS, 2006, 4193 : 771 - 777
  • [33] Comparing Integer Linear Programming to SAT-Solving for Hard Problems in Computational and Systems Biology
    Brown, Hannah
    Zuo, Lei
    Gusfield, Dan
    ALGORITHMS FOR COMPUTATIONAL BIOLOGY (ALCOB 2020), 2020, 12099 : 63 - 76
  • [34] Augmenting All Solution SAT Solving for Circuits with Structural Information
    Tibebu, Abraham Temesgen
    Fey, Goerschwin
    2018 IEEE 21ST INTERNATIONAL SYMPOSIUM ON DESIGN AND DIAGNOSTICS OF ELECTRONIC CIRCUITS AND SYSTEMS (DDECS), 2018, : 117 - 122
  • [35] Applying Modern SAT-solvers to Solving Hard Problems
    Niewiadomski, Artur
    Switalski, Piotr
    Sidoruk, Teofil
    Penczek, Wojciech
    FUNDAMENTA INFORMATICAE, 2019, 165 (3-4) : 321 - 344
  • [36] On the hardness of solving edge matching puzzles as SAT or CSP problems
    Carlos Ansótegui
    Ramón Béjar
    Cèsar Fernández
    Carles Mateu
    Constraints, 2013, 18 : 7 - 37
  • [37] A Heuristic SAT Problems Solving Method based on LSTM Network
    Wang, Yichuan
    Liang, Xiaolong
    Hei, Xinhong
    Zhu, Lei
    Ji, Wenjiang
    PAAP 2021: 2021 12TH INTERNATIONAL SYMPOSIUM ON PARALLEL ARCHITECTURES, ALGORITHMS AND PROGRAMMING, 2021, : 141 - 145
  • [38] An SVM-Based Prediction Method for Solving SAT Problems
    HUANG Shaobin
    LI Ya
    LI Yanmei
    ChineseJournalofElectronics, 2019, 28 (02) : 246 - 252
  • [39] An Efficient Approach to Solving Random k-sat Problems
    Gilles Dequen
    Olivier Dubois
    Journal of Automated Reasoning, 2006, 37 : 261 - 276
  • [40] An efficient approach to solving random k-SAT problems
    Dequen, Gilles
    Dubois, Olivier
    JOURNAL OF AUTOMATED REASONING, 2006, 37 (04) : 261 - 276
12345