New applications for an old tool
|Author||Valencia Cabrera, Luis
Orellana Martín, David
Pérez Hurtado de Mendoza, Ignacio
Pérez Jiménez, Mario de Jesús
|Editor||Research Group on Natural Computing|
|Department||Universidad de Sevilla. Departamento de Ciencias de la Computación e Inteligencia Artificial|
|Published in||BWMC 2019: Seventeenth Brainstorming Week on Membrane Computing (2019), p 165-170|
|Abstract||First, the dependency graph technique, not so far from its current application,
was developed trying to nd the shortest computations for membrane systems
solving instances of SAT. Certain families of membrane systems ...
First, the dependency graph technique, not so far from its current application, was developed trying to nd the shortest computations for membrane systems solving instances of SAT. Certain families of membrane systems have been demonstrated to be non-effcient by means of the reduction of nding an accepting computation (respectively, rejecting computation) to the problem of reaching from a node of the dependency graph to another one. In this paper, a novel application to this technique is explained. Supposing that a problem can be solved by means of a kind of membrane systems leads to a contradiction by means of using the dependency graph as a reasoning method. In this case, it is demonstrated that a single system without dissolution, polarizations and cooperation cannot distinguish a single object from more than one object. An extended version of this work will be presented in the 20th International Conference on Membrane Computing.
|Cite||Valencia Cabrera, L., Orellana Martín, D., Pérez Hurtado, I. y Pérez Jiménez, M.d.J. (2019). New applications for an old tool. En BWMC 2019: Seventeenth Brainstorming Week on Membrane Computing (165-170), Sevilla, España: Escuela Técnica Superior de Ingeniería Informática, Universidad de Sevilla.|