Quasiphysical and quasisociological algorithm - Solar for solving SAT problem

被引：4

作者：

Huang, WQ ^{[1
]}

Jin, RC ^{[1
]}

机构：

[1] Huazhong Univ Sci & Technol, Sch Comp Sci & Technol, Wuhan 430074, Peoples R China

来源：

SCIENCE IN CHINA SERIES E-TECHNOLOGICAL SCIENCES | 1999年 / 42卷 / 05期

基金：

中国国家自然科学基金; 高等学校博士学科点专项科研基金;

关键词：

CNF; satisfiability; quasiphysical; quasisociological; algorithm;

D O I：

10.1007/BF02917401

中图分类号：

T [工业技术];

学科分类号：

08 ;

摘要：

Using both quasiphysical and quasisociological methods, in conjunction with an inheriting strategy, a new way strategy and a pardon strategy was proposed for efficiently solving the SAT problem, An intuitive explanation is given for the Bart Selman random walk strategy. A new algorithm, Solar, was devised by combining these strategies. The new algorithm is shown to be both faster and stabler than the heretofore best algorithm.

引用

页码：485 / 493

页数：9