Solving the SAT problem using spiking neural P systems with coloured spikes and division rules

Kód výsledku v 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>

Výsledek na webu

<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>

Jazyk výsledku

angličtina

Název v původním jazyce

Solving the SAT problem using spiking neural P systems with coloured spikes and division rules

Popis výsledku v původním jazyce

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.

Název v anglickém jazyce

Solving the SAT problem using spiking neural P systems with coloured spikes and division rules

Popis výsledku anglicky

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.

Druh

J_imp - Článek v periodiku v databázi Web of Science

CEP obor

—

OECD FORD obor

10201 - Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)

Projekt

—

Návaznosti

S - Specificky vyzkum na vysokych skolach

Rok uplatnění

2024

Kód důvěrnosti údajů

S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Název periodika

Journal of Membrane Computing

ISSN

2523-8906

e-ISSN

2523-8914

Svazek periodika

6

Číslo periodika v rámci svazku

3

Stát vydavatele periodika

GB - Spojené království Velké Británie a Severního Irska

Počet stran výsledku

12

Strana od-do

222-233

Kód UT WoS článku

001230074500001

EID výsledku v databázi Scopus

2-s2.0-85193935588