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 条
  • [21] A NEW ALGORITHM FOR THE PROPOSITIONAL SATISFIABILITY PROBLEM
    GALLO, G
    PRETOLANI, D
    DISCRETE APPLIED MATHEMATICS, 1995, 60 (1-3) : 159 - 179
  • [22] A parallel quantum algorithm for the satisfiability problem
    Liu Wen-Zhang
    Zhang Jing-Fu
    Long Gui-Lu
    COMMUNICATIONS IN THEORETICAL PHYSICS, 2008, 49 (03) : 629 - 630
  • [23] An Algorithm Based on Resolution for the Satisfiability Problem
    Xu, Youjun
    Ouyang, Dantong
    Ye, Yuxin
    2ND IEEE INTERNATIONAL CONFERENCE ON ADVANCED COMPUTER CONTROL (ICACC 2010), VOL. 4, 2010, : 420 - 423
  • [24] Retrieving and matching RDF graphs by solving the satisfiability problem*
    Liu, Sheng
    Zhang, Jian
    2006 IEEE/WIC/ACM INTERNATIONAL CONFERENCE ON WEB INTELLIGENCE, (WI 2006 MAIN CONFERENCE PROCEEDINGS), 2006, : 510 - +
  • [25] Machine Learning Methods in Solving the Boolean Satisfiability Problem
    Guo, Wenxuan
    Zhen, Hui-Ling
    Li, Xijun
    Luo, Wanqian
    Yuan, Mingxuan
    Jin, Yaohui
    Yan, Junchi
    MACHINE INTELLIGENCE RESEARCH, 2023, 20 (05) : 640 - 655
  • [26] Machine Learning Methods in Solving the Boolean Satisfiability Problem
    Wenxuan Guo
    Hui-Ling Zhen
    Xijun Li
    Wanqian Luo
    Mingxuan Yuan
    Yaohui Jin
    Junchi Yan
    Machine Intelligence Research, 2023, 20 : 640 - 655
  • [27] SOLVING THE MAXIMUM SATISFIABILITY PROBLEM BY FUZZY CONVERTING IT INTO A CONTINUOUS OPTIMIZATION PROBLEM
    Tseng, Lin-Yu
    Chen, Chun
    PROCEEDINGS OF 2014 INTERNATIONAL CONFERENCE ON MACHINE LEARNING AND CYBERNETICS (ICMLC), VOL 1, 2014, : 352 - 358
  • [28] An Effective Simulated Annealing Algorithm for Solving the Traveling Salesman Problem
    Wang, Zicheng
    Geng, Xiutang
    Shao, Zehui
    JOURNAL OF COMPUTATIONAL AND THEORETICAL NANOSCIENCE, 2009, 6 (07) : 1680 - 1686
  • [29] On solving 3CNF-satisfiability with an in vivo algorithm
    Eng, TL
    BIOSYSTEMS, 1999, 52 (1-3) : 135 - 141
  • [30] A Refined Branching Algorithm for the Maximum Satisfiability Problem
    Wenjun Li
    Chao Xu
    Yongjie Yang
    Jianer Chen
    Jianxin Wang
    Algorithmica, 2022, 84 : 982 - 1006
12345