Design and implementation of satisfiability solver of formulas about strings

被引：0
|
作者：
Umemura, Akihiro [1 ]
机构：
[1] NTT DATA Corp., Japan
来源：
Computer Software | 2010年 / 27卷 / 01期
关键词：
15;
D O I：
暂无
中图分类号：
学科分类号：
摘要：
引用
收藏
页码：101 / 119
相关论文
共 50 条
  • [21] Scalable Parallel Solver of Boolean Satisfiability Problems
    Bogdanova, V. G.
    Gorsky, S. A.
    2018 41ST INTERNATIONAL CONVENTION ON INFORMATION AND COMMUNICATION TECHNOLOGY, ELECTRONICS AND MICROELECTRONICS (MIPRO), 2018, : 222 - 227
  • [22] Autotuning a Random Walk Boolean Satisfiability Solver
    Cui, Tao
    Franchetti, Franz
    PROCEEDINGS OF THE INTERNATIONAL CONFERENCE ON COMPUTATIONAL SCIENCE (ICCS), 2011, 4 : 2176 - 2185
  • [23] EXAMINING THE SATISFIABILITY OF THE FORMULAS OF PROPOSITIONAL DYNAMIC LOGIC
    JANOWSKI, T
    LECTURE NOTES IN COMPUTER SCIENCE, 1989, 349 : 536 - 536
  • [24] Satisfiability of Acyclic and Almost Acyclic CNF Formulas
    Ordyniak, Sebastian
    Paulusma, Daniel
    Szeider, Stefan
    IARCS ANNUAL CONFERENCE ON FOUNDATIONS OF SOFTWARE TECHNOLOGY AND THEORETICAL COMPUTER SCIENCE (FSTTCS 2010), 2010, 8 : 84 - 95
  • [25] Satisfiability of acyclic and almost acyclic CNF formulas
    Ordyniak, Sebastian
    Paulusma, Daniel
    Szeider, Stefan
    THEORETICAL COMPUTER SCIENCE, 2013, 481 : 85 - 99
  • [26] Partitioning methods for satisfiability testing on large formulas
    Park, TJ
    Van Gelder, A
    INFORMATION AND COMPUTATION, 2000, 162 (1-2) : 179 - 184
  • [27] Local Search for Solving Satisfiability of Polynomial Formulas
    Li, Haokun
    Xia, Bican
    Zhao, Tianqi
    COMPUTER AIDED VERIFICATION, CAV 2023, PT II, 2023, 13965 : 87 - 109
  • [28] Design and implementation of a parser/solver for SDPs with matrix structure
    Wu, SP
    Boyd, S
    PROCEEDINGS OF THE 1996 IEEE INTERNATIONAL SYMPOSIUM ON COMPUTER-AIDED CONTROL SYSTEM DESIGN, 1996, : 240 - 245
  • [29] ON THE COMPLEXITY OF THE MAXIMUM SATISFIABILITY PROBLEM FOR HORN FORMULAS
    JAUMARD, B
    SIMEONE, B
    INFORMATION PROCESSING LETTERS, 1987, 26 (01) : 1 - 4
  • [30] Satisfiability testing for boolean formulas using Δ-trees
    Gutiérrez G.
    De Guzmán I.P.
    Martínez J.
    Ojeda-Aciego M.
    Valverde A.
    Studia Logica, 2002, 72 (1) : 85 - 112
12345