## 3 Results: AGA Logic Variables for Scene Description and Dialog Communications
### Communication Phrase

Table 5: Word phrase \(\mathbf{W^{K}}\) is to be written by the header and several content parts in the logic code, and formed by words taken from a sampling, \(K^{\prime}\), of all defined \(KxM\) vocabularies. Notation \(w_{v,m}^{K}\) indicates a word with arbitrarily given indexes, \(v,m\), chosen by the expert or decision-maker from some \(V_{v,m}^{K}\). The header part includes obligatory fields, \"format\", \"fixed parole\", \"addresser\", and \"sender\", with the fixed position in the phrase for the quick and simple procession. Priority of position of the root and other vocabularies in the phrase is given by the field \"format\". The value \(w_{1,1}^{K}\) = \"Hi\" may be given by several various numbers, initiating the new dialog and also indicating the number of content parts. The field \"fixed parole\" is intended for the initial access of preliminary allowed agents, and it includes words taken from the vocabulary \(V_{1,2}^{K}\) that contain fixed passwords for initial contact only. Further communication modules in sender and addresser should assign quasi-random hashes to content parts of the phrase. Every content part also includes the obligatory field \"hash\", describing assigned one-time quasi-random hashes necessary for correct integration of transferred parts into the holistic phrase. This field is used to store random keys, taken from the storage, containing data received from an external QRNG [69] or a random oracle scheme [61]. The fields \"arbitrary code word, \(w_{v,m}\)\" in the content parts of the phrase are to be filled in by arbitrarily chosen words, forming some sampling, \(K^{\prime}\), of logic variables, where \(K^{\prime}\leq K\). The maximal number of content parts, \(j\), in the phrase is determined by the expression  
\[j=N_{\text{\emph{used vocab. in phrase}}}-N_{\text{\emph{used in header}}}/N_{\text{\emph{free fields in cont. part}}}=\left(K\times M-4\right)/N_{\text{\emph{free fields in cont. part}}} \tag{7}\]  
The format of messages shown in the Table 5 certainly can be further adapted for a specific knowledge domain, a large number of participants, and large space and time bands of work. For example, for extraordinary situations like a fire, any robot should have a reserved code word in the field \"format\" for the activation of chain vocabularies, describing phrases like {Fire service-Fire department q-Fire robot qq-\(\ldots\)] and {City q-Municipal district qq-Street qqq-\(\ldots\)]. But for routine tasks such as long chains of vocabularies, it can be excessive. Total check coefficients, \(C^{K}\) and \(C^{N}\), shown in Table 5, need special commentary, as they suppose arithmetic summation of word codes for message integrity verification. Such verification procedures for a noisy data line can determine if some parts of the phrase were modified, added, or lost due to noise or intruders. This method assumes the summations of codes for all used indexes, \(v\) and \(m\), and parts of phrase. As the summation is not initially defined in AGA [70], and one cannot directly use Boolean calculations for the set of truth-level data; words codes should be preliminary mapped onto the scale of natural numbers, \(N\), before traditional arithmetic calculations. The results of the calculations should coincide for sums obtained by the addresser and sender. For 8-bit microcontrollers [85; 86] with embedded arithmetic procedures, this check unavoidably uses the summation with case overflow, which provides the independence of the verification parameter from the number of actually used words and transmitted parts of the phrase. Besides this, in such schemes, the well-known binary operation XOR, used in [85], may be also applied for the detection of errors in parts of the phrase. In order to use such verification schemes, one should make several definitions.