Abstract
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.
Highlights
For problems permitting their formalization in predicate calculus language
their negations which are valid for parts of the object
the following problems are considered in the paper
Summary
Что, вообще говоря, доказательство следования формулы ∃xA(x) из списка других формул не обеспечивает www.proceedings.spiiras.nw.ru нахождения тех значений x, для которых A(x) верна при сформулированных условиях. Если m максимальное число переменных в элементарных конъюнкциях, входящих в целевые формулы, то при использовании алгоритма полного перебора число шагов решения любой из сформулированных выше задач составляет
Sign-in/Register to view highlights & summary Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
