Community-based 3-SAT formulas with a predefined solution

被引:0
|
作者
Hu Y. [1 ]
Luo W. [1 ,2 ]
Wang J. [1 ]
机构
[1] School of Computer Science and Technology, University of Science and Technology of China, Anhui, Hefei
[2] School of Computer Science and Technology, Harbin Institute of Technology, Shenzhen, Harbin
基金
中国国家自然科学基金;
关键词
community structure; predefined solution; SAT generator;
D O I
10.1504/IJWMC.2021.121603
中图分类号
学科分类号
摘要
It is crucial to generate SAT formulas with predefined solutions for the development of SAT solvers since many SAT formulas from real-world applications have solutions. Although some algorithms have been proposed to generate SAT formulas with predefined solutions, community structures of SAT formulas are not considered in these algorithms. Consequently, we propose a 3-SAT formula generating algorithm that not only guarantees the existence of a predefined solution, but also simultaneously considers community structures and clause distributions. To study the effect of community structures and clause distributions on the hardness of SAT formulas, we measure solving runtimes of two solvers, gluHack and CPSparrow, on the generated SAT formulas under different parameter settings. Through extensive experiments, we obtain some noteworthy observations. For example, the community structure has few or no effects on the hardness of SAT formulas with regard to CPSparrow but a strong effect with regard to gluHack. Copyright © 2021 Inderscience Enterprises Ltd.
引用
收藏
页码:310 / 322
页数:12
相关论文
共 50 条
  • [21] Improved Randomized Algorithms for 3-SAT
    Iwama, Kazuo
    Seto, Kazuhisa
    Takai, Tadashi
    Tamaki, Suguru
    ALGORITHMS AND COMPUTATION, PT I, 2010, 6506 : 73 - +
  • [22] Derandomizing the HSSW Algorithm for 3-SAT
    Kazuhisa Makino
    Suguru Tamaki
    Masaki Yamamoto
    Algorithmica, 2013, 67 : 112 - 124
  • [23] 3-SAT using island-based genetic algorithm
    Mohammed S.M.Z.
    Khader A.T.
    Al-Betar M.A.
    Mohammed, Salmah Mousbah Zeed (salmah.mousbah@gmail.com), 1694, Institute of Electrical Engineers of Japan (136): : 1694 - 1698
  • [24] An evolutionary framework for 3-SAT problems
    Borgulya, I
    ITI 2003: PROCEEDINGS OF THE 25TH INTERNATIONAL CONFERENCE ON INFORMATION TECHNOLOGY INTERFACES, 2003, : 471 - 476
  • [25] Random 3-SAT: The plot thickens
    Coarfa, C
    Demopoulos, DD
    Aguirre, AS
    Subramanian, D
    Vardi, MY
    CONSTRAINTS, 2003, 8 (03) : 243 - 261
  • [26] Derandomizing the HSSW Algorithm for 3-SAT
    Makino, Kazuhisa
    Tamaki, Suguru
    Yamamoto, Masaki
    ALGORITHMICA, 2013, 67 (02) : 112 - 124
  • [27] Approximating MIN 2-SAT and MIN 3-SAT
    Avidor, A
    Zwick, U
    THEORY OF COMPUTING SYSTEMS, 2005, 38 (03) : 329 - 345
  • [28] Scalability of the surface-based DNA algorithm for 3-SAT
    Li, Dafa
    Li, Xiangrong
    Huang, Hongtao
    Li, Xinxin
    BIOSYSTEMS, 2006, 85 (02) : 95 - 98
  • [29] Approximating MIN 2-SAT and MIN 3-SAT
    Adi Avidor
    Uri Zwick
    Theory of Computing Systems, 2005, 38 : 329 - 345
  • [30] The phase transition in 1-in-k SAT and NAE 3-SAT
    Achlioptas, D
    Chtcherba, A
    Istrate, G
    Moore, C
    PROCEEDINGS OF THE TWELFTH ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS, 2001, : 721 - 722