2024
Solving the SAT problem using spiking neural P systems with coloured spikes and division rules
PAUL, Prithwineel and Petr SOSÍKBasic information
Original name
Solving the SAT problem using spiking neural P systems with coloured spikes and division rules
Authors
PAUL, Prithwineel and Petr SOSÍK
Edition
Journal of Membrane Computing, Singapore, Springer Nature, 2024, 2523-8906
Other information
Language
English
Type of outcome
Article in a journal
Field of Study
10201 Computer sciences, information science, bioinformatics
Country of publisher
United Kingdom of Great Britain and Northern Ireland
Confidentiality degree
is not subject to a state or trade secret
References:
Impact factor
Impact factor: 2.900
Marked to be transferred to RIV
Yes
RIV identification code
RIV/47813059:19240/24:A0001430
Organization unit
Faculty of Philosophy and Science in Opava
UT WoS
EID Scopus
Keywords in English
Spiking neural P system; Neuron division; Coloured spikes; SAT problem
Tags
International impact, Reviewed
Changed: 29/1/2025 16:25, Mgr. Kamil Matula, Ph.D.
Abstract
In the original language
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.