Solving the SAT problem using spiking neural P systems with coloured spikes and division rules
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F47813059%3A19240%2F24%3AA0001430" target="_blank" >RIV/47813059:19240/24:A0001430 - isvavai.cz</a>
Result on the web
<a href="https://link.springer.com/article/10.1007/s41965-024-00153-0" target="_blank" >https://link.springer.com/article/10.1007/s41965-024-00153-0</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.1007/s41965-024-00153-0" target="_blank" >10.1007/s41965-024-00153-0</a>
Alternative languages
Result language
angličtina
Original language name
Solving the SAT problem using spiking neural P systems with coloured spikes and division rules
Original language description
Spiking neural P systems (SNPS) are variants of the third-generation neural networks. In the last few decades, different variants of SNPS models have been introduced. In most of the SNPS models, spikes are represented using an alphabet with just one letter. In this paper, we use a deterministic SNPS model with coloured spikes (i.e. the alphabet representing spikes contains multiple letters), together with neuron division rules to demonstrate an efficient solution to the SAT problem. As a result, we provide a simpler construction with significantly less class resources to solve the SAT problem in comparison to previously reported results using SNPSs.
Czech name
—
Czech description
—
Classification
Type
J<sub>imp</sub> - Article in a specialist periodical, which is included in the Web of Science database
CEP classification
—
OECD FORD branch
10201 - Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)
Result continuities
Project
—
Continuities
S - Specificky vyzkum na vysokych skolach
Others
Publication year
2024
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů
Data specific for result type
Name of the periodical
Journal of Membrane Computing
ISSN
2523-8906
e-ISSN
2523-8914
Volume of the periodical
6
Issue of the periodical within the volume
3
Country of publishing house
GB - UNITED KINGDOM
Number of pages
12
Pages from-to
222-233
UT code for WoS article
001230074500001
EID of the result in the Scopus database
2-s2.0-85193935588