A Uniform Algorithm of Solving All-SAT Using Membrane Systems

Abstract

This paper investigates the All-SAT problem via cell-like membrane system, which is a new distributed and parallel computing model. Up to now, All-SAT has been difficut to solve. As we know, the traditional All-SAT algorithms have a exponential time complexity. Therefore, we need to find new methods. In this paper, we present a uniform solution to the All-SAT problem to obtain an exponential working space in a linear time by using membrane division. First, we propose a method to solve All-SAT problem based on membrane computing model and give the detailed algorithm. Second, according to the algorithm, we introduce the definition of the membrane system and its specific membrane model. Then we construct the evolution rules of the model. Furthermore, we put forward specific implementation process. Our membrane model has fewer nested membranes and simpler rules, therefore it has high efficiency. The effectiveness and efficiency of the proposed system is demonstrated by an instance. Comparing with most of the algorithms using membrane systems, the proposed algorithm can provide all solutions of SAT.

The computational power of timed P systems with active membranes using promoters

“…In this paper, we will pay close attention to P systems with active membranes. Based on this model, the SAT problem has been solved effectively (see Guo et al 2015;Luo et al 2015Luo et al , 2016Leporati et al 2009). But in these papers, it is assumed that each rule can be completed in exactly one unit time in a standard P system with active membranes.…”