Heuristico-Conceptual Programming

HEURISTICO-CONCEPTUAL PROGRAMMING

v.v. Chavchanidze

Director of the Institute of Cibernetics of Academy of Sciences of Georgian SSR, Tbilisi, USSR

It is shown thav the method of ana­ lyvical heuristics /2/, binarized t·orma­ lism /3/ and the model of Artificial Co­ nc~ptual Intelligence /4/ could be succ­ essfully used as a basis for describing the process of "arrivJ.ng at decisions" based on the unified description of ube­ ginning of conditions", "body ot· condi­ tions" t 11 begiiming uf L'eSpOnCeS" t "bo~ of responces", "be~inning o1· a.ecisions ', "body of decisions' /2/ by means of bi­ nary wave form of J:epresenting variaoles in tne vector-mavrix form. The binary wave addressing we introduce vhat can be used for the "action space" as well, ma­ kes it possible to solve the decision search problems wivhout scanning diffi­ culties, The comple'tie "wave binarizati­ on" of all the components for "behaviour during decision taking makes the soluti­ on of direct and reverse problem feasib­ le, that is compilation of special "sys­ tem of e~uations for accomulation of ex­ perience and "system of equations for decisions and conclusions". This method is formally presented as the one of de­ cision table programming /1/.

It is shown that the vector-matric­ es of states we have introduced are "fu­ zzy" (L. Zadeh). The programs for multy­ factor system estimation are created. It is illustrated by means of a well-known example of heuristical programming that theory avoids "scanning". Matrix form of an AI heuristico-conceptual model is ea­ sily presented in the form of block-di­ agrams and programs.

R e f e r e n c e s

1. XaM6H 9. nnorpaMMHpoBaHHe Ta6nH~ pe­ meHHif. I976.
2. qaBqaHH~ae B.B. B c6."EcTeCTBeHHH~ H HCKyCCTBeHHH~ HHTenneKT.(KOH~eDTyan~­ HHM no~xo~)". MaTepwanH IY MOK~~-75, I976.
3. qaBqaHH~3e B.B. Coo6meHHH AH rccP, T.63, ~. I97I.
4. qaBqaHH~ae B.B. nAH CCCP, T.230, ~' I976.