A New Approach for Solving SAT by P Systems with Active Membranes
In this paper we give two families of P systems with active membranes that can solve the satisfiability problem of propositional formulas in linear time in the number of propositional variables occurring in the input formula. These solutions do not use polarizations of the membranes or non-elementary membrane division but use separation rules with relabeling. The first solution is a uniform one, but it is not polynomially uniform. The second solution, which is based on the first one, is a polynomially semi-uniform solution.
KeywordsMembrane computing P systems SAT problem
Unable to display preview. Download preview PDF.
- 5.Gazdag, Z., Kolonits, G.: A New Approach for Solving SAT by P Systems with Active Membranes. In: Csuhaj-Varjú, E., Gheorghe, M., Rozenberg, G., Salomaa, A., Vaszil, G. (eds.) CMC 2012. LNCS, vol. 7762, pp. 195–207. Springer, Heidelberg (2013)Google Scholar
- 6.Kusper, G.: Solving and Simplifying the Propositional Satisfiability Problem by Sub-Model Propagation. Ph.D. thesis, RISC, Johannes Kepler University, Linz, Austria (2005)Google Scholar
- 10.Paun, G.: Introduction to membrane computing. In: Applications of Membrane Computing, pp. 1–42 (2006)Google Scholar