TY - JOUR

T1 - Multi-agent description of an object by means of a predicate calculus language Vol. 23, No 4. 2016. P. 338 – 346.

AU - Kosovskaya, T.

PY - 2016

Y1 - 2016

N2 - A problem of multi-agent description of a complex object is under consideration. It is supposed that an object may be described in the terms of its parts properties and relations between these parts. But every agent has only a part of the object description and does not know the true names of elements and gives them names arbitrary. An algorithm solving the posed problem is described and the upper bound of its steps are proved.

AB - A problem of multi-agent description of a complex object is under consideration. It is supposed that an object may be described in the terms of its parts properties and relations between these parts. But every agent has only a part of the object description and does not know the true names of elements and gives them names arbitrary. An algorithm solving the posed problem is described and the upper bound of its steps are proved.

KW - multi-agent description of an object

KW - predicate calculus

KW - partial deduction

KW - computational complexity of an algorithm

M3 - Article

VL - 23

SP - 338

EP - 346

JO - International Journal on Information Theory and Applications

JF - International Journal on Information Theory and Applications

SN - 1310-0513

IS - 4

ER -