A New Approach for Solving SAT by P Systems with Active Membranes

Gazdag, Zsolt; Kolonits, Gábor

doi:10.1007/978-3-642-36751-9_14

Cited by 17 publications

(15 citation statements)

References 8 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…After this, membrane (C, a) is dissolved using rules in (2). In the next two steps, w 1 is duplicated first due the division of membrane (C, b) by rules in (3), then the yielded membranes are dissolved by rules in (4). Thus, at this point of the computation two copies of w 1 are in membrane d w .…”

Section: Correctness Running Time and (L L)-uniformitymentioning

confidence: 99%

“…Assume for example that l C contains C ∃ C and V ∃ y . Then the computation goes in the same way as in the case of Statement 2 until the application of the corresponding dissolution rules in (4). But now the second rule in (5) is applied, and thus, in the next step, only the second rule in (6) can be applied.…”

Section: Correctness Running Time and (L L)-uniformitymentioning

confidence: 99%

“…Among the many research lines in Membrane Computing, one is to find efficient solutions of computationally hard problems by various types of recognizer P systems with active membranes (see e.g. [2,3,4,17,18,22]). …”

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

Remarks on the Computational Power of Some Restricted Variants of P Systems with Active Membranes

Gazdag

Kolonits

2017

Membrane Computing

Self Cite

View full text Add to dashboard Cite

Summary. In this paper we consider three restricted variants of P systems with active membranes: (1) P systems using out communication rules only, (2) P systems using elementary membrane division and dissolution rules only, and (3) polarizationless P systems using dissolution and restricted evolution rules only. We show that every problem in P can be solved with uniform families of any of these variants. This, using known results on the upper bound of the computational power of variants (1) and (3) yields new characterizations of the class P. In the case of variant (2) we provide a further characterization of P by giving a semantic restriction on the computations of P systems of this variant.

show abstract

Section: Correctness Running Time and (L L)-uniformitymentioning

confidence: 99%

Section: Correctness Running Time and (L L)-uniformitymentioning

confidence: 99%

See 1 more Smart Citation

Remarks on the Computational Power of Some Restricted Variants of P Systems with Active Membranes

Gazdag

Kolonits

2017

Membrane Computing

Self Cite

View full text Add to dashboard Cite

show abstract

“…7 Solving SAT by P systems with active membranes is widely investigated. [8][9][10][11][12][13][14] These solutions mainly differ in the types of the rules and the various controlling strategies. But to All-SAT, most of the algorithms mentioned above provide a yes/no answer.…”

Section: Introductionmentioning

confidence: 99%

A Uniform Algorithm of Solving All-SAT Using Membrane Systems

Luo

Xiong

Tan

et al. 2015

j comput theor nanosci

View full text Add to dashboard Cite

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.

show abstract

“…This is usually written as the problem of deciding if X belongs to PMC F or not. It has been studied for many P system models F and for many decision problems X (see, e.g., [2,3,4,5] and references therein).…”

Section: Introductionmentioning

confidence: 99%

Solving the ST-Connectivity Problem with Pure Membrane Computing Techniques

Gazdag

Gutiérrez–Naranjo

2014

Membrane Computing

Self Cite

View full text Add to dashboard Cite

Summary. In Membrane Computing, the solution of a decision problem X belonging to the complexity class P via a polynomially uniform family of recognizer P systems is trivial, since the polynomial encoding of the input can involve the solution of the problem. The design of such solution has one membrane, two objects, two rules and one computation step. Stricto sensu, it is a solution in the framework of Membrane Computing, but it does not use Membrane Computing strategies. In this paper, we present three designs of uniform families of P systems that solve the decision problem STCON by using Membrane Computing strategies (pure Membrane Computing techniques): P systems with membrane creation, P systems with active membranes with dissolution and without polarizations and P systems with active membranes without dissolution and with polarizations. Since STCON is NL-complete, such designs are constructive proofs of the belonging of NL to PMCMC, PMC AM 0 +d and PMC AM + −d.

show abstract

A New Approach for Solving SAT by P Systems with Active Membranes

Cited by 17 publications

References 8 publications

Remarks on the Computational Power of Some Restricted Variants of P Systems with Active Membranes

Remarks on the Computational Power of Some Restricted Variants of P Systems with Active Membranes

A Uniform Algorithm of Solving All-SAT Using Membrane Systems

Solving the ST-Connectivity Problem with Pure Membrane Computing Techniques

Contact Info

Product

Resources

About