Affiliation:
1. Ural Federal University
Abstract
GSAT is a well-known satisfiability search algorithm for conjunctive normal forms. GSAT uses some random functions. One of such functions is a function of starting population of truth assignments for the variables of conjunctive normal form. In this paper, we consider a method of artificial physics optimization for computing a function of starting population.
Publisher
Trans Tech Publications, Ltd.
Reference13 articles.
1. A. Gorbenko, V. Popov, Programming for Modular Reconfigurable Robots, Programming and Computer Software 38 (2012) 13-23.
2. A. Gorbenko, Graph-Theoretic Models for the Module of Safe Planning for Control Systems of Mobile Robots, Advanced Materials Research 683 (2013) 737-740.
3. A. Gorbenko, V. Popov, Self-Learning of Robots and the Model of Hamiltonian Path with Fixed Number of Color Repetitions for Systems of Scenarios Creation, Advanced Materials Research 683 (2013) 909-912.
4. A. Gorbenko, V. Popov, The set of parameterized k-covers problem, Theor. Comput. Sci. 423 (2012) 19-24.
5. B. Selman, H. Levesque, D. Mitchell, A new method for solving hard satisfiability problems, in: Proceedings of the Tenth National Conference on Artificial Intelligence, AAAI Press, 1992, pp.440-446.
Cited by
5 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献