Solving of sat – problems of artificial intelligence with the help of local elimination algorithms
Miroshnik, M. A.
Tsekhmistro, R. I.
Demichev, А. I
Институт радиофизики и электроники им. А. Я. Усикова - научно-исследовательский институт Национальной академии наук Украины,
Using elimination algorithms are promising for solving of the problem of propositional calculus testing. These problems are widely used in the practical checking of digital electron circuits of modern telecommunications. Based on the fuzzy logic, acyclic graph these algorithms provides a way for typical presentations of SAT-problems.
Intelligent systems of processing and representing the knowledge are presently developed towards the integration of symbol and image representations of scientific knowledge. In combination with well-developed hardware and software multimedia tools this trend in engineering of science has a great practical importance especially at the stage of conversion of paper documents into their electronic equivalents. In this situation there occur some problems related to the form of representation of knowledge, configuration of user interfaces, recognition of the input information and providing for high speed of its search and processing.
resolver, resolution, graph of interrelationships, directed acyclic graph, local algorithm
R.I. Tsekhmistro Solving of sat – problems of artificial intelligence with the help of local elimination algorithms / М. А. Мiroshnik, R. I. Tsekhmistro, А. I. Demichev // Telecommunications and Radio Engineering -2016- 75 (7)-р. 621-630