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 条
  • [1] Solving the SAT problem with the string multiset rewriting calculus
    Battyanyi, Peter
    COMPUTING, 2024, 106 (05) : 1321 - 1334
  • [2] Solving String Constraints Using SAT
    Lotz, Kevin
    Goel, Amit
    Dutertre, Bruno
    Kiesl-Reiter, Benjamin
    Kong, Soonho
    Majumdar, Rupak
    Nowotka, Dirk
    COMPUTER AIDED VERIFICATION, CAV 2023, PT II, 2023, 13965 : 187 - 208
  • [3] USING STRING-REWRITING FOR SOLVING THE WORD PROBLEM FOR FINITELY PRESENTED GROUPS
    MADLENER, K
    OTTO, F
    INFORMATION PROCESSING LETTERS, 1987, 24 (05) : 281 - 284
  • [4] Modular Multiset Rewriting
    Cervesato, Iliano
    Lam, Edmund S. L.
    LOGIC FOR PROGRAMMING, ARTIFICIAL INTELLIGENCE, AND REASONING, (LPAR-20 2015), 2015, 9450 : 515 - 531
  • [5] On the Complexity of Concurrent Multiset Rewriting
    Bertier, Marin
    Perrin, Matthieu
    Tedeschi, Cedric
    INTERNATIONAL JOURNAL OF FOUNDATIONS OF COMPUTER SCIENCE, 2016, 27 (01) : 67 - 83
  • [6] A PROMISEBQP-COMPLETE STRING REWRITING PROBLEM
    Janzing, Dominik
    Wocjan, Pawel
    QUANTUM INFORMATION & COMPUTATION, 2010, 10 (3-4) : 234 - 257
  • [7] Static Termination Analysis for Prolog Using Term Rewriting and SAT Solving
    Schneider-Kamp, Peter
    KUNSTLICHE INTELLIGENZ, 2010, 24 (01): : 79 - 81
  • [8] REDUCING THE GRADEDNESS PROBLEM OF STRING REWRITING SYSTEMS TO A TERMINATION PROBLEM
    Stein, Itamar
    RAIRO-THEORETICAL INFORMATICS AND APPLICATIONS, 2015, 49 (03): : 233 - 254
  • [9] Generalized mapping for multiset rewriting systems
    Kharal, Athar
    Alshehri, Mansoor H.
    Bin Turki, Nasser
    Duraihem, Faisal Z.
    SOFT COMPUTING, 2021, 25 (17) : 11439 - 11448
  • [10] Multiset rewriting and security protocol analysis
    Mitchell, JC
    REWRITING TECHNIQUES AND APPLICATIONS, 2002, 2378 : 19 - 22
12345