Abstract
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.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Rainer, S.: An algorithm for the satisfiability problem of formulas in conjunctive normal form. Journal of Algorithms 54, 40–44 (2005)
Ivancie, F., Yang, Z., Ganai, M.K.: Effident SAT-based bounded model checking for software verifications. Theoretical Computer Science 404, 256–274 (2008)
Jussi, R.: Planning as satisfiability: Heuristics. Artificial Intelligence 193, 45–86 (2012)
Cui, T., Franchetti, F.: Autotuning a random walk boolean satisfiability solver. Procedia Computer Science 4, 2176–2185 (2011)
Yousef, K.: Comparing the performance of the genetic and local search algorithms for solving the satisfiability problems. Applied Soft Computing 10, 198–207 (2010)
Xu, J., Dong, Y.F., Wei, X.P.: Sticker DNA computer model-Part I:Theory. Chinese Science Bulletin 49, 205–212 (2004)
Xu, J., Li, S.P., Dong, Y.F., Wei, X.P.: Sticker DNA computer model-Part II: application. Chinese Science Bulletin 49, 229–307 (2004)
Zhou, K., Chen, J.: Simulation DNA algorithm of set covering problem. Applied Mathematics and Information Sciences 8, 139–144 (2014)
Zhou, K., Wei, C.J., Liu, S., Lu, J.: Simulation DNA algorithm of all solutions of Eight Queens Problem. Journal of Huazhong University of Science and Technology (Natural Science Edition) 37, 24–27 (2009)
Plaisted, D.A., Biere, A., Zhu, Y.S.: A satisfiability procedure for quantified boolean formulae. Discrete Applied Mathematics 130, 291–328 (2003)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2014 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Dai, P., Zhou, K., Wei, Z., Hu, D., Liu, C. (2014). Simulation DNA Algorithm. In: Pan, L., Păun, G., Pérez-Jiménez, M.J., Song, T. (eds) Bio-Inspired Computing - Theories and Applications. Communications in Computer and Information Science, vol 472. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-662-45049-9_14
Download citation
DOI: https://doi.org/10.1007/978-3-662-45049-9_14
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-662-45048-2
Online ISBN: 978-3-662-45049-9
eBook Packages: Computer ScienceComputer Science (R0)