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 条
  • [31] Quasiphysical and quasisociological algorithm - Solar for solving SAT problem
    Huang, WQ
    Jin, RC
    SCIENCE IN CHINA SERIES E-TECHNOLOGICAL SCIENCES, 1999, 42 (05): : 485 - 493
  • [32] SAT-Solving the Coverability Problem for Petri Nets
    Parosh Aziz Abdulla
    S. Purushothaman Iyer
    Aletta Nylén
    Formal Methods in System Design, 2004, 24 : 25 - 43
  • [33] SAT-solving the coverability problem for Petri nets
    Abdulla, PA
    Iyer, SP
    Nylén, A
    FORMAL METHODS IN SYSTEM DESIGN, 2004, 24 (01) : 25 - 43
  • [34] Lifted bayesian filtering in multiset rewriting systems
    Lüdtke S.
    Kirste T.
    Journal of Artificial Intelligence Research, 2020, 69 : 1203 - 1254
  • [35] Transforming SAT into Termination of Rewriting
    Zankl, Harald
    Sternagel, Christian
    Middeldorp, Aart
    ELECTRONIC NOTES IN THEORETICAL COMPUTER SCIENCE, 2009, 246 : 199 - 214
  • [36] Integral calculus problem solving: an fMRI investigation
    Krueger, Frank
    Spampinato, Maria Vittoria
    Pardini, Matteo
    Pajevic, Sinisa
    Wood, Jacqueline N.
    Weiss, George H.
    Landgraf, Steffen
    Grafman, Jordan
    NEUROREPORT, 2008, 19 (11) : 1095 - 1099
  • [37] Exceptions in the rewriting calculus
    Faure, G
    Kirchner, C
    REWRITING TECHNIQUES AND APPLICATIONS, 2002, 2378 : 66 - 82
  • [38] Graph rewriting for the π-calculus
    Gadducci, Fabio
    MATHEMATICAL STRUCTURES IN COMPUTER SCIENCE, 2007, 17 (03) : 407 - 437
  • [39] A NOVEL ALGORITHM FOR SOLVING THE STRING MATCHING PROBLEM
    El Emary, Ibrahiem M. M.
    Jaber, Mohammed S. M.
    INTERNATIONAL JOURNAL OF COMPUTATIONAL INTELLIGENCE AND APPLICATIONS, 2006, 6 (04) : 499 - 510
  • [40] Visual multiset rewriting: Applications to diagram parsing and reasoning
    Bottoni, P
    Meyer, B
    Presicce, FP
    MULTISET PROCESSING: MATHEMATICAL, COMPUTER SCIENCE, AND MOLECULAR COMPUTING POINTS OF VIEW, 2001, 2235 : 45 - 67
12345