TY - JOUR

T1 - Discrete Artificial Intelligence Problems and Number of Steps of their Solution

AU - Kosovskaya, T.M.

PY - 2011

Y1 - 2011

N2 - Aggregate characteristics of discrete models appearing in different artificial intelligence problems are considered. It is shown that if an investigated object is a collection of its elements and its description contains properties of these elements and relations between them then a predicate calculus language is convinient for its simulation. In such a case a lot of problems are NP-hard. Upper bounds of steps for two essentially different decision algorithms are presented. A problem of transformation of an investigated object and the number of its decision steps is regarded. A many-level approach (consisting in the extraction of subformulas of goal conditions) to the decision of these problems is described. It allows to decrease the used time.

AB - Aggregate characteristics of discrete models appearing in different artificial intelligence problems are considered. It is shown that if an investigated object is a collection of its elements and its description contains properties of these elements and relations between them then a predicate calculus language is convinient for its simulation. In such a case a lot of problems are NP-hard. Upper bounds of steps for two essentially different decision algorithms are presented. A problem of transformation of an investigated object and the number of its decision steps is regarded. A many-level approach (consisting in the extraction of subformulas of goal conditions) to the decision of these problems is described. It allows to decrease the used time.

KW - artificial intelligence

KW - pattern recognition

KW - analysis of situation

KW - transformation

KW - predicate calculus

KW - complexity of algorithm.

M3 - Article

VL - 18

SP - 93

EP - 99

JO - International Journal on Information Theory and Applications

JF - International Journal on Information Theory and Applications

SN - 1310-0513

IS - 1

ER -