|
Trudy SPIIRAN, 2010, Issue 14, Pages 58–75
(Mi trspy393)
|
|
|
|
This article is cited in 6 scientific papers (total in 6 papers)
Some artificial intelligence problems permitting formalization by means of predicate calculus language and upper bounds of their solution steps
T. M. Kosovskayaabc a St. Petersburg Institute for Informatics and Automation of RAS
b St. Petersburg State University, Department of Mathematics and Mechanics
c State Marine Technical University of St. Petersburg
Abstract:
Some artificial intelligence problems including such ones as pattern recognition, medical diagnostics, market analysis is reduced to the proof of satisfiability of predicate calculus formulas with a symple structure. Some algorithms solving such problems are regarded and the upper bounds of their steps are proved.
Keywords:
artificial intelligence, predicate calculus formulas, complexity of algorithm, NP-compleetness.
Received: 17.12.2010
Citation:
T. M. Kosovskaya, “Some artificial intelligence problems permitting formalization by means of predicate calculus language and upper bounds of their solution steps”, Tr. SPIIRAN, 14 (2010), 58–75
Linking options:
https://www.mathnet.ru/eng/trspy393 https://www.mathnet.ru/eng/trspy/v14/p58
|
Statistics & downloads: |
Abstract page: | 334 | Full-text PDF : | 209 | References: | 56 | First page: | 1 |
|