Scholarlink

<p>In this paper, we use generalized spiking neural P systems model with structural plasticity (SNPSP) for solving the <b>SAT</b> problem. It is an interesting variant of the spiking neural P systems (SNPS) model. In generalized SNPS with structural plasticity models, more than one synaptic connection can be established between two neurons using plasticity rules. The system proposed in the paper solves <b>SAT</b> problem in a deterministic and uniform manner. More specifically, the solution belongs to the category of EXP-uniform, i.e., the initial configuration of the system, a deterministic Turing machine cannot use less than an exponential number of computational steps. The time required to solve <b>SAT</b> problem is linear in <i>n</i> and <i>m</i> where <i>n</i> and <i>m</i> are the numbers of variables and clauses respectively. Our work is the first solution to use pre-computed resources with structural dynamism, that is plasticity rules in this case, to solve the <b>SAT</b> problem. Also, no delay is associated with the rules of the SNPS system proposed in this paper.</p>

错误：搜索内容不能为空，请输入英文关键词
错误：关键词超出字数限制，请精简
高级检索

Solving the SAT problem using spiking neural P systems with structural plasticity and pre-computed resources

  • 期刊论文

  • 出版模式：

    开放获取

  • 发表日期：

    2025年8月18日

查看全文
  • Prithwineel Paul,
  • Francis George C. Cabarle

摘要

In this paper, we use generalized spiking neural P systems model with structural plasticity (SNPSP) for solving the SAT problem. It is an interesting variant of the spiking neural P systems (SNPS) model. In generalized SNPS with structural plasticity models, more than one synaptic connection can be established between two neurons using plasticity rules. The system proposed in the paper solves SAT problem in a deterministic and uniform manner. More specifically, the solution belongs to the category of EXP-uniform, i.e., the initial configuration of the system, a deterministic Turing machine cannot use less than an exponential number of computational steps. The time required to solve SAT problem is linear in n and m where n and m are the numbers of variables and clauses respectively. Our work is the first solution to use pre-computed resources with structural dynamism, that is plasticity rules in this case, to solve the SAT problem. Also, no delay is associated with the rules of the SNPS system proposed in this paper.