Skip to main content
SpringerLink
Log in

Solving SAT with P systems with anti-membranes

  • Research Paper
  • Published:
Journal of Membrane Computing Aims and scope Submit manuscript

Abstract

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.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Adorna, H. N., Pan, L., & Song, B. (2018). On distributed solution to SAT by membrane computing. International Journal of Computers Communications and Control, 13(3), 303–320. https://doi.org/10.15837/ijccc.2018.3.3217

    Article  Google Scholar 

  2. Alhazov, A., Aman, B., & Freund, R. (2014). P systems with anti-matter. Lecture Notes in Computer Science. In M. Gheorghe, G. Rozenberg, A. Salomaa, P. Sosík, & C. Zandron (Eds.), 15th International Conference on Membrane Computing, CMC 2014 (Vol. 8961, pp. 66–85). Springer. https://doi.org/10.1007/978-3-319-14370-5_5

  3. Alhazov, A., Aman, B., Freund, R., & Păun, G. (2014). Matter and anti-matter in membrane systems. Lecture Notes in Computer Science. In H. Jürgensen, J. Karhumäki, & A. Okhotin (Eds.), 6th international workshop on descriptional complexity of formal systems, DCFS 2014 (Vol. 8614, pp. 65–76). Springer. https://doi.org/10.1007/978-3-319-09704-6_7

  4. Alhazov, A., Pan, L., & Păun, G. (2004). Trading polarizations for labels in P systems with active membranes. Acta Informatica, 41(2–3), 111–144. https://doi.org/10.1007/s00236-004-0153-z

    Article  MathSciNet  MATH  Google Scholar 

  5. Alhazov, A., & Sburlan, D. (2006). Static sorting P systems. In G. Ciobanu, M. J. Pérez-Jiménez, & G. Păun (Eds.), Applications of membrane computing, natural computing series (pp. 215–252). Springer. https://doi.org/10.1007/3-540-29937-8_8

    Google Scholar 

  6. Aman, B. (2022). On the efficiency of synchronized P systems. Journal of Membrane Computing, 4(1), 1–10. https://doi.org/10.1007/s41965-021-00091-1

    Article  MathSciNet  Google Scholar 

  7. Aman, B., & Ciobanu, G. (2008). Describing the immune system using enhanced mobile membranes. Electronic Notes in Theoretical Computer Science, 194(3), 5–18. https://doi.org/10.1016/j.entcs.2007.12.003

    Article  MATH  Google Scholar 

  8. Aman, B., & Ciobanu, G. (2009). Turing completeness using three mobile membranes. Lecture Notes in Computer Science. In C. S. Calude, J. F. Costa, N. Dershowitz, E. Freire, & G. Rozenberg (Eds.), 8th international conference on unconventional computation, UC 2009 (Vol. 5715, pp. 42–55). Springer. https://doi.org/10.1007/978-3-642-03745-0_12

  9. Aman, B., & Ciobanu, G. (2011). Mobility in process calculi and natural computing. Natural computing series. Springer. https://doi.org/10.1007/978-3-642-24867-2

    Book  MATH  Google Scholar 

  10. Aman, B., & Ciobanu, G. (2011). Solving a weak NP-complete problem in polynomial time by using mutual mobile membrane systems. Acta Informatica, 48(7–8), 409–415. https://doi.org/10.1007/s00236-011-0144-9

    Article  MathSciNet  MATH  Google Scholar 

  11. Aman, B., & Ciobanu, G. (2017). Efficiently solving the bin packing problem through bio-inspired mobility. Acta Informatica, 54(4), 435–445. https://doi.org/10.1007/s00236-016-0264-3

    Article  MathSciNet  MATH  Google Scholar 

  12. Aman, B., & Ciobanu, G. (2018). Adaptive P systems. Lecture Notes in Computer Science. In T. Hinze, G. Rozenberg, A. Salomaa, & C. Zandron (Eds.), 19th international conference on membrane computing, CMC 2018 (Vol. 11399, pp. 57–72). Springer. https://doi.org/10.1007/978-3-030-12797-8_5

  13. Aman, B., & Ciobanu, G. (2019). Synchronization of rules in membrane computing. Journal of Membrane Computing, 1(4), 233–240. https://doi.org/10.1007/s41965-019-00022-1

    Article  MathSciNet  MATH  Google Scholar 

  14. Buño, K. C., & Adorna, H. N. (2020). Distributed computation of a k P systems with active membranes for SAT using clause completion. Journal of Membrane Computing, 2(2), 108–120. https://doi.org/10.1007/s41965-020-00040-4

    Article  MathSciNet  MATH  Google Scholar 

  15. Buño, K. C., Cabarle, F. G. C., Calabia, M. D., & Adorna, H. N. (2018). Solving the N-queens problem using dP systems with active membranes. Theoretical Computer Science, 736, 1–14. https://doi.org/10.1016/j.tcs.2017.12.013

    Article  MathSciNet  MATH  Google Scholar 

  16. Cecilia, J. M., García, J. M., Guerrero, G. D., Martínez-del-Amor, M. A., Pérez-Hurtado, I., & Pérez-Jiménez, M. J. (2010). Simulating a P system based efficient solution to SAT by using GPUs. Journal of Logic and Algebraic Programming, 79(6), 317–325. https://doi.org/10.1016/j.jlap.2010.03.008

    Article  MathSciNet  MATH  Google Scholar 

  17. Ciobanu, G., & Krishna, S. N. (2011). Enhanced mobile membranes: Computability results. Theory of Computing Systems, 48(3), 715–729. https://doi.org/10.1007/s00224-010-9256-9

    Article  MathSciNet  MATH  Google Scholar 

  18. Ciobanu, G., Pérez-Jiménez, M. J., & Păun, G. (Eds.). (2006). Applications of membrane computing. Natural computing series. Springer. https://doi.org/10.1007/3-540-29937-8

    Google Scholar 

  19. Díaz-Pernil, D., Peña-Cantillana, F., Alhazov, A., Freund, R., & Gutiérrez-Naranjo, M. A. (2014). Antimatter as a frontier of tractability in membrane computing. Fundamenta Informaticae, 134(1–2), 83–96. https://doi.org/10.3233/FI-2014-1092

    Article  MathSciNet  MATH  Google Scholar 

  20. Freund, R., Alhazov, A., & Ivanov, S. (2019). P systems with anti-membranes. In Proceedings of the 20th international conference on membrane computing, CMC 2019 (pp. 249–256).

  21. Frisco, P., Gheorghe, M., & Pérez-Jiménez, M. J. (Eds.). (2014). Applications of membrane computing in systems and synthetic biology. Emergence, complexity and computation. Springer. https://doi.org/10.1007/978-3-319-03191-0

  22. Garey, M. R., & Johnson, D. S. (1979). Computers and intractability: A guide to the theory of NP-completeness. W. H. Freeman.

    MATH  Google Scholar 

  23. Gazdag, Z. (2013). Solving SAT by P systems with active membranes in linear time in the number of variables. Lecture Notes in Computer Science. In A. Alhazov, S. Cojocaru, M. Gheorghe, Y. Rogozhin, G. Rozenberg, & A. Salomaa (Eds.), 14th international conference on membrane computing, CMC 2013 (Vol. 8340, pp. 189–205). Springer. https://doi.org/10.1007/978-3-642-54239-8_14

  24. Gazdag, Z., & Kolonits, G. (2012). A new approach for solving SAT by P systems with active membranes. Lecture Notes in Computer Science. In E. Csuhaj-Varjú, M. Gheorghe, G. Rozenberg, A. Salomaa, & G. Vaszil (Eds.), 13th international conference on membrane computing, CMC 2012 (Vol. 7762, pp. 195–207). Springer. https://doi.org/10.1007/978-3-642-36751-9_14

  25. Gheorghe, M., & Ipate, F. (2013). A kernel P systems survey. Lecture Notes in Computer Science. In A. Alhazov, S. Cojocaru, M. Gheorghe, Y. Rogozhin, G. Rozenberg, & A. Salomaa (Eds.), 14th international conference on membrane computing, CMC 2013 (Vol. 8340, pp. 1–9). Springer. https://doi.org/10.1007/978-3-642-54239-8_1

  26. Gutiérrez-Naranjo, M. A., Pérez-Jiménez, M. J., & Romero-Campero, F. J. (2007). A uniform solution to SAT using membrane creation. Theoretical Computer Science, 371(1–2), 54–61. https://doi.org/10.1016/j.tcs.2006.10.013

    Article  MathSciNet  MATH  Google Scholar 

  27. Luo, Y., Xiong, Z., Tan, H., & Xia, S. (2015). A uniform algorithm of solving all-SAT using membrane systems. Journal of Computational and Theoretical Nanoscience, 12(12), 5825–5832. https://doi.org/10.1166/jctn.2015.4723

    Article  Google Scholar 

  28. Orellana-Martín, D., Valencia-Cabrera, L., Riscos-Núñez, A., & Pérez-Jiménez, M. J. (2019). Minimal cooperation as a way to achieve the efficiency in cell-like membrane systems. Journal of Membrane Computing, 1(2), 85–92. https://doi.org/10.1007/s41965-018-00004-9

    Article  MathSciNet  MATH  Google Scholar 

  29. Pan, L., & Alhazov, A. (2006). Solving HPP and SAT by P systems with active membranes and separation rules. Acta Informatica, 43(2), 131–145. https://doi.org/10.1007/s00236-006-0018-8

    Article  MathSciNet  MATH  Google Scholar 

  30. Pan, L., & Păun, G. (2009). Spiking neural P systems with anti-spikes. International Journal of Computers Communications and Control, 4(3), 273–282. https://doi.org/10.15837/ijccc.2009.3.2435

    Article  Google Scholar 

  31. Păun, G. (2001). P systems with active membranes: Attacking NP-complete problems. Journal of Automata, Languages and Combinatorics, 6(1), 75–90. https://doi.org/10.25596/jalc-2001-075

    MathSciNet  MATH  Google Scholar 

  32. Păun, G. (2002). Membrane computing: An introduction. Natural computing series. Springer. https://doi.org/10.1007/978-3-642-56196-2

    Book  MATH  Google Scholar 

  33. Păun, G., & Pérez-Jiménez, M. J. (2010). Solving problems in a distributed way in membrane computing: DP systems. International Journal of Computers Communications and Control, 5(2), 238–250. https://doi.org/10.15837/ijccc.2010.2.2478

    Article  Google Scholar 

  34. Păun, G., Rozenberg, G., & Salomaa, A. (2010). The Oxford handbook of membrane computing. Oxford University Press.

    Book  MATH  Google Scholar 

  35. Pérez-Jiménez, M. J. (2004). An approach to computational complexity in membrane computing. Lecture Notes in Computer Science. In G. Mauri, G. Păun, M. J. Pérez-Jiménez, G. Rozenberg, & A. Salomaa (Eds.), 5th international workshop on membrane computing, WMC 2004 (Vol. 3365, pp. 85–109). Springer. https://doi.org/10.1007/978-3-540-31837-8_5

  36. Pérez-Jiménez, M. J., Jiménez, Á. R., & Sancho-Caparrini, F. (2003). Complexity classes in models of cellular computing with membranes. Natural Computing, 2(3), 265–285. https://doi.org/10.1023/A:1025449224520

    Article  MathSciNet  MATH  Google Scholar 

  37. Pérez-Jiménez, M. J., Riscos-Núñez, A., Romero-Jiménez, Á., & Woods, D. (2010). Complexity: Membrane division, membrane creation. In The Oxford handbook of membrane computing (pp. 302–336).

  38. Riscos-Núñez, A., & Valencia-Cabrera, L. (2022). From SAT to SAT-UNSAT using P systems with dissolution rules. Journal of Membrane Computing, 4(2), 97–106. https://doi.org/10.1007/s41965-022-00095-5

    Article  MathSciNet  Google Scholar 

  39. Song, B., Pérez-Jiménez, M. J., & Pan, L. (2016). An efficient time-free solution to SAT problem by P systems with proteins on membranes. Journal of Computer and System Sciences, 82(6), 1090–1099. https://doi.org/10.1016/j.jcss.2016.03.008

    Article  MathSciNet  MATH  Google Scholar 

  40. Song, B., Zhang, C., & Pan, L. (2017). Tissue-like P systems with evolutional symport/antiport rules. Information Sciences, 378, 177–193. https://doi.org/10.1016/j.ins.2016.10.046

    Article  MathSciNet  MATH  Google Scholar 

  41. Song, T., Macías-Ramos, L. F., Pan, L., & Pérez-Jiménez, M. J. (2014). Time-free solution to SAT problem using P systems with active membranes. Theoretical Computer Science, 529, 61–68. https://doi.org/10.1016/j.tcs.2013.11.014

    Article  MathSciNet  MATH  Google Scholar 

  42. Zhang, G., Pérez-Jiménez, M. J., & Gheorghe, M. (Eds.). (2017). Real-life applications with membrane computing. Emergence, complexity and computation. Springer. https://doi.org/10.1007/978-3-319-55989-6

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institute of Computer Science, Romanian Academy, Iaşi, 700505, Romania

    Bogdan Aman

  2. Faculty of Computer Science, Alexandru Ioan Cuza University, Iaşi, 700506, Romania

    Bogdan Aman

Authors
  1. Bogdan Aman
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Bogdan Aman.

Additional information

Publisher's Note

Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Rights and permissions

Springer Nature or its licensor (e.g. a society or other partner) holds exclusive rights to this article under a publishing agreement with the author(s) or other rightsholder(s); author self-archiving of the accepted manuscript version of this article is solely governed by the terms of such publishing agreement and applicable law.

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Aman, B. Solving SAT with P systems with anti-membranes. J Membr Comput 5, 100–107 (2023). https://doi.org/10.1007/s41965-023-00121-0

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s41965-023-00121-0

Keywords

Search

Navigation