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 条
  • [41] Solving the SAT Problem by Cell-Like P Systems with Channel States and Symport Rules
    Wan, Xiaoming
    Liu, Chuchuan
    Luo, Yueguo
    DISCRETE DYNAMICS IN NATURE AND SOCIETY, 2023, 2023
  • [42] Solving k-SAT problems with generalized quantum measurement
    Zhang, Yipei
    Lewalle, Philippe
    Whaley, K. Birgitta
    arXiv,
  • [43] SELECTION OF SEARCH STRATEGIES FOR SOLVING 3-SAT PROBLEMS
    Pulka, Andrzej
    INTERNATIONAL JOURNAL OF APPLIED MATHEMATICS AND COMPUTER SCIENCE, 2014, 24 (02) : 283 - 297
  • [44] An SVM-Based Prediction Method for Solving SAT Problems
    Huang Shaobin
    Li Ya
    Li Yanmei
    CHINESE JOURNAL OF ELECTRONICS, 2019, 28 (02) : 246 - 252
  • [45] Solving the SAT problem using spiking neural P systems with coloured spikes and division rules
    Paul, Prithwineel
    Sosik, Petr
    JOURNAL OF MEMBRANE COMPUTING, 2024, 6 (03) : 222 - 233
  • [46] On the hardness of solving edge matching puzzles as SAT or CSP problems
    Ansotegui, Carlos
    Bejar, Ramon
    Fernandez, Cesar
    Mateu, Carles
    CONSTRAINTS, 2013, 18 (01) : 7 - 37
  • [47] An efficient approach to solving random k-sat problems
    Dequen, Gilles
    Dubois, Olivier
    Journal of Automated Reasoning, 2006, 37 (04): : 261 - 276
  • [48] Solving Very Hard Problems: Cube-and-Conquer, a Hybrid SAT Solving Method
    Heule, Marijn J. H.
    Kullmann, Oliver
    Marek, Victor W.
    PROCEEDINGS OF THE TWENTY-SIXTH INTERNATIONAL JOINT CONFERENCE ON ARTIFICIAL INTELLIGENCE, 2017, : 4864 - 4868
  • [49] Solving dynamical inverse problems by means of Metabolic P systems
    Manca, V.
    Marchetti, L.
    BIOSYSTEMS, 2012, 109 (01) : 78 - 86
  • [50] Solving Streaming Capacity Problems in P2P VoD Systems
    He, Yifeng
    Guan, Ling
    IEEE TRANSACTIONS ON CIRCUITS AND SYSTEMS FOR VIDEO TECHNOLOGY, 2010, 20 (11) : 1638 - 1642
12345