Location of Repository

Solving SAT in linear time with a neural-like membrane system

By Juan Pazos Sierra, Alfonso Rodríguez-Patón Aradas and Andrés Silva Vazquez

Abstract

We present in this paper a neural-like membrane system solving the SAT problem in linear time. These neural Psystems are nets of cells working with multisets. Each cell has a finite state memory, processes multisets of symbol-impulses, and can send impulses (?excitations?) to the neighboring cells. The maximal mode of rules application and the replicative mode of communication between cells are at the core of the eficiency of these systems

Topics: Informática
Publisher: Facultad de Informática (UPM)
Year: 2003
DOI identifier: 10.1007/3-540-44868-3_84
OAI identifier: oai:oa.upm.es:15928
Provided by: Archivo Digital UPM
Downloaded from http://oa.upm.es/15928/

Suggested articles

Preview

Citations

  1. (1943). A logical calculus of the ideas immanent in nervous activity, doi
  2. (2000). Computing with membranes, doi
  3. (1998). Essential Cell Biology. An Introduction to the Molecular Biology of the Cell, doi
  4. (1999). et al (24 co-authors), Connectionist symbol processing: Dead or alive?,
  5. (2001). Gamma and the chemical abstract reaction model: fifteen years after, in vol. doi
  6. (2003). Gheorghe Paun, Juan Pazos and Alfonso Rodriguez-Paton, Tissue P systems, doi
  7. (2002). Membrane Computing. doi
  8. (2001). Multiset automata, in vol. doi
  9. Parallel finite automata systems communicating by states, doi
  10. (1986). Products of Automata, doi
  11. (1956). Representation of events in nerve nets and finite automata, Automata Studies,
  12. (1999). The Touchstone of Life. Molecular Information, Cell Communication, and the Foundations of Life, doi
  13. (1995). Using DNA to solve NP-complete problems,

To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.