论文信息 - Simulation DNA Algorithm

Simulation DNA Algorithm

Satisfiability problem (SAT) is one of classical combinational problems, which is proved to be a famous NP-complete problem [1]. SAT is widely used [2], [3]. At present, research on algorithm of SAT has made significant progress [4], [5]. Among these algorithms, some are non polynomial even though they can obtain exact solution of SAT; and heuristic algorithm cannot obtain exact solution of SAT, even though it is polynomial. Therefore, it is essential to find an exact algorithm of SAT which is more practical and can effectively the control calculation time.

[1] Malay K. Ganai,et al. Efficient SAT-based bounded model checking for software verification , 2008, Theor. Comput. Sci..

[2] Franz Franchetti,et al. Autotuning a Random Walk Boolean Satisfiability Solver , 2011, ICCS.

[3] Jussi Rintanen,et al. Planning as satisfiability: Heuristics , 2012, Artif. Intell..

[4] Xiaopeng Wei,et al. Sticker DNA computer model —Part I: Theory , 2004 .

[5] Jin Chen,et al. Simulation DNA Algorithm of Set Covering , 2014 .

[6] Jin Chen,et al. Simulation DNA Algorithm of Set Covering Problem , 2014 .

[7] Rainer Schuler,et al. An algorithm for the satisfiability problem of formulas in conjunctive normal form , 2005, J. Algorithms.

[8] Armin Biere,et al. A satisfiability procedure for quantified Boolean formulae , 2003, Discret. Appl. Math..

[9] Yafei Dong,et al. Sticker DNA computer model — Part II: Application , 2004 .

[10] Yousef Kilani. Comparing the performance of the genetic and local search algorithms for solving the satisfiability problems , 2010, Appl. Soft Comput..