Solving SAT with P systems with anti-membranes

被引：0
|
作者：
Bogdan Aman
机构：
[1] Romanian Academy,Institute of Computer Science
[2] Alexandru Ioan Cuza University,Faculty of Computer Science
来源：
Journal of Membrane Computing | 2023年 / 5卷
关键词：
Membrane computing; SAT problem; Anti-membranes; Annihilation rules;
D O I：
暂无
中图分类号：
学科分类号：
摘要：
P systems with anti-membranes represent a variant of P systems with anti-matter in which the concept of annihilation between a matter object and its corresponding anti-matter object is replaced by annihilation between a membrane and its corresponding anti-membrane. In this paper P systems with anti-membranes are shown to be powerful enough such that only by using label changing, annihilation and division rules, polynomial time solutions are provided for the NP-complete problem SAT. The proposed solution for the SAT problem uses an exponential number of rules to create an exponential working space.
引用
收藏
页码：100 / 107
页数：7
相关论文
共 50 条
  • [21] Improving Efficiency of 3-SAT-Solving Tile Systems
    Brun, Yuriy
    DNA COMPUTING AND MOLECULAR PROGRAMMING, 2011, 6518 : 1 - 12
  • [22] Solving PP-Complete and #P-Complete Problems by P Systems with Active Membranes
    Alhazov, Artiom
    Burtseva, Liudmila
    Cojocaru, Svetlana
    Rogozhin, Yurii
    MEMBRANE COMPUTING, 2009, 5391 : 108 - 117
  • [23] CUD@SAT: SAT solving on GPUs
    Dal Palu, Alessandro
    Dovier, Agostino
    Formisano, Andrea
    Pontelli, Enrico
    JOURNAL OF EXPERIMENTAL & THEORETICAL ARTIFICIAL INTELLIGENCE, 2015, 27 (03) : 293 - 316
  • [24] On P systems with active membranes solving the integer factorization problem in a polynomial time
    Obtulowicz, A
    MULTISET PROCESSING: MATHEMATICAL, COMPUTER SCIENCE, AND MOLECULAR COMPUTING POINTS OF VIEW, 2001, 2235 : 267 - 285
  • [25] Solving NP-complete problems using P systems with active membranes
    Zandron, C
    Ferretti, C
    Mauri, G
    UNCONVENTIONAL MODELS OF COMPUTATION UMC' 2K, PROCEEDINGS, 2001, : 289 - 301
  • [26] On P systems with active membranes solving the integer factorization problem in a polynomial time
    Obtulowicz, Adam
    Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2001, 2235 : 267 - 285
  • [27] Multithreaded SAT solving
    Lewis, Matthew
    Schubert, Tobias
    Becker, Bernd
    PROCEEDINGS OF THE ASP-DAC 2007, 2007, : 926 - +
  • [28] From SAT to SAT-UNSAT using P systems with dissolution rules
    Riscos-Núñez A.
    Valencia-Cabrera L.
    Journal of Membrane Computing, 2022, 4 (02) : 97 - 106
  • [29] Accelerating SAT Based Planning with Incremental SAT Solving
    Gocht, Stephan
    Balyo, Tomas
    TWENTY-SEVENTH INTERNATIONAL CONFERENCE ON AUTOMATED PLANNING AND SCHEDULING, 2017, : 135 - 139
  • [30] Time-free solution to SAT problem by P systems with active membranes and standard cell division rules
    Song, Bosheng
    Song, Tao
    Pan, Linqiang
    NATURAL COMPUTING, 2015, 14 (04) : 673 - 681
12345