Some artificial intelligence problems permitting formalization by means of predicate calculus language and upper bounds of their solution steps
Tatiana Matveevna Kosovskaya · Informatics and Automation · 2014
Some artificial intelligence problems including such ones as pattern recognition, medical diagnostics, market analysis is reduced to the proof of satisfi\-abi\-li\-ty of predicate calculus formulas with a symple structure. Some algorithms solving such problems are regarded and the upper bounds of their steps are proved.