Solving the SAT problem with the string multiset rewriting calculus

被引：0
|
作者：
Péter Battyányi
机构：
[1] University of Debrecen,Department of Computer Science, Faculty of Informatics
来源：
Computing | 2024年 / 106卷
关键词：
String multiset rewriting; Biologically motivated computing; SAT-problem; 68Q07; 68Q42; 68Q85;
D O I：
暂无
中图分类号：
学科分类号：
摘要：
In this paper, we develop computing machinery within the framework of the String Multiset Rewriting calculus (SMSR), as defined by Barbuti et al. [4], to solve the SAT problem in linear time regarding the number of variables of a given conjunctive normal form. This shows that SMSR can be considered a computational model capable of significantly reducing the time requirement of classical decision problems.
引用
收藏
页码：1321 / 1334
页数：13
相关论文
共 50 条
  • [41] Approximate Probabilistic Parallel Multiset Rewriting Using MCMC
    Luedtke, Stefan
    Schroeder, Max
    Kirste, Thomas
    KI 2018: ADVANCES IN ARTIFICIAL INTELLIGENCE, 2018, 11117 : 73 - 85
  • [42] Sequential and maximally parallel multiset rewriting: reversibility and determinism
    Artiom Alhazov
    Rudolf Freund
    Kenichi Morita
    Natural Computing, 2012, 11 : 95 - 106
  • [43] Logical string rewriting
    Manca, V
    THEORETICAL COMPUTER SCIENCE, 2001, 264 (01) : 25 - 51
  • [44] Swarm-Based Multiset Rewriting Computing Models
    Fujioka, Kaoru
    UNCONVENTIONAL COMPUTATION AND NATURAL COMPUTATION, UCNC 2019, 2019, 11493 : 79 - 93
  • [45] Datamining Techniques and Swarm Intelligence for Problem Solving: Application to SAT
    Drias, Habiba
    Hireche, Celia
    Douib, Ameur
    2013 WORLD CONGRESS ON NATURE AND BIOLOGICALLY INSPIRED COMPUTING (NABIC), 2013, : 200 - 206
  • [46] A parallel algorithm for solving sat problem based on dna computing
    Darehmiraki, M.
    International Journal of Computers and Applications, 2009, 31 (02) : 128 - 131
  • [47] Minimization strategies for maximally parallel multiset rewriting systems
    Alhazov, Artiom
    Verlan, Sergey
    THEORETICAL COMPUTER SCIENCE, 2011, 412 (17) : 1581 - 1591
  • [48] Relating strands and multiset rewriting for security protocol analysis
    Cervesato, I
    Durgin, N
    Mitchell, J
    Lincoln, P
    Scedrov, A
    13TH IEEE COMPUTER SECURITY FOUNDATIONS WORKSHOP, PROCEEDINGS, 2000, : 35 - 54
  • [49] Multiset Rewriting: A Semantic Framework for Concurrency with Name Binding
    Rosa-Velardo, Fernando
    REWRITING LOGIC AND ITS APPLICATIONS, 2010, 6381 : 191 - 207
  • [50] Visual multiset rewriting: Applications to diagram parsing and reasoning
    Bottoni, Paolo
    Meyer, Bernd
    Presicce, Francesco Parisi
    Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2001, 2235 : 45 - 67
12345