An effective molecular algorithm for solving the satisfiability problem

被引：0
|
作者：
Yu, W [1 ]
Zheng, WM [1 ]
机构：
[1] Tsinghua Univ, Dept Comp & Technol, Beijing 100084, Peoples R China
来源：
ADVANCED PARALLEL PROCESSING TECHNOLOGIES, PROCEEDINGS | 2003年 / 2834卷
关键词：
D O I：
暂无
中图分类号：
TP3 [计算技术、计算机技术];
学科分类号：
0812 ;
摘要：
A well-defined satisfiability problem (SAT) is mapped into a unique expression of logical array by introducing a transformation. Such an expression forms a unique molecular algorithm for solving SAT, which is prone to computation on an electronic computer. A famous 20-variable instance of the three-satisfiability problem is solved via Matrix laboratory (MATLAB) installed on a notebook computer. The special computation implements huge parallelism that goes beyond I million (2(20)). The unique solution is found and the computational complexity is analyzed.
引用
收藏
页码：274 / 280
页数：7
相关论文
共 50 条
  • [31] Simulation DNA Algorithm Model of Satisfiability Problem
    Zhou, Kang
    Fan, Lili
    Shao, Kai
    Dong, Wenbo
    JOURNAL OF COMPUTATIONAL AND THEORETICAL NANOSCIENCE, 2015, 12 (07) : 1220 - 1227
  • [32] An algorithm based on tabu search for satisfiability problem
    Huang, WQ
    Zhang, DF
    Wang, HX
    JOURNAL OF COMPUTER SCIENCE AND TECHNOLOGY, 2002, 17 (03) : 340 - 346
  • [33] An algorithm based on tabu search for satisfiability problem
    Wenqi Huang
    Defu Zhang
    Houxiang Wang
    Journal of Computer Science and Technology, 2002, 17 : 340 - 346
  • [34] Evolutionary local search algorithm for the satisfiability problem
    Aksoy, Levent
    Gunes, Ece Olcay
    ARTIFICIAL INTELLIGENCE AND NEURAL NETWORKS, 2006, 3949 : 185 - 193
  • [35] A Refined Branching Algorithm for the Maximum Satisfiability Problem
    Li, Wenjun
    Xu, Chao
    Yang, Yongjie
    Chen, Jianer
    Wang, Jianxin
    ALGORITHMICA, 2022, 84 (04) : 982 - 1006
  • [36] AN EFFICIENT ALGORITHM FOR THE 3-SATISFIABILITY PROBLEM
    BILLIONNET, A
    SUTTER, A
    OPERATIONS RESEARCH LETTERS, 1992, 12 (01) : 29 - 36
  • [37] A randomized diversification strategy for solving satisfiability problem with long clauses
    Jian Gao
    Ruizhi Li
    Minghao Yin
    Science China Information Sciences, 2017, 60
  • [38] A Heuristic Restart Strategy to Speed Up the Solving of Satisfiability Problem
    Guo, Ying
    Zhang, Bin
    Zhang, Changsheng
    2012 FIFTH INTERNATIONAL SYMPOSIUM ON COMPUTATIONAL INTELLIGENCE AND DESIGN (ISCID 2012), VOL 2, 2012, : 423 - 426
  • [39] Cooperative ant colonies for solving the maximum weighted satisfiability problem
    Drias, H
    Taibi, A
    Zekour, S
    COMPUTATIONAL METHODS IN NEURAL MODELING, PT 1, 2003, 2686 : 446 - 453
  • [40] Solving the Workflow Satisfiability Problem Using General Purpose Solvers
    Karapetyan, Daniel
    Gutin, Gregory
    IEEE TRANSACTIONS ON DEPENDABLE AND SECURE COMPUTING, 2023, 20 (06) : 4474 - 4485
12345