## 3 Results: AGA Logic Variables for Scene Description and Dialog Communications
### Communication Module and the Dialog Protocol
Flexible enough variant is to use short enough 8-byte phrase parts, easy for procession by mass platforms with 8-bit microcontrollers with embedded arithmetic summation and logic XOR operations. Such scheme also can be recommended for earlier published versions of AGA-based LL [68; 69], which mix every next notation with the previous one. Then, instead of Table 8, one should use the basic version of LL notation in [69], shown further as case (a) in Table 9, with more convenient arrangement of indexed input variables; as in AGA, the order of their succession is not substantial [70]. Another aspect of the choice of AGA function for LL is the desire to avoid prediction of often repeated values of words \(w^{K}_{v,jm}\) for mass robotic tasks. Even the space localization of a robot prompts some most probable combinations of used in dialog words, what enlarges the possibility of illegal data modifications. AGA versions of LL should assign quasi-random numbers in hash values, \(h\), and they should include them in total check coefficients, \(C^{K/N}\) (using summation of mapped truth levels), and ones, \(C^{KXR}\) (using binary XOR operations). Such total coefficients for parts and whole phrases complicate the external prediction of instructions for frequently repeated tasks. Also, one can periodically change the coding for truth-level representation, and for situations with the high risk of illegal activity of cheaters, one can exploit standard NIST techniques of secret coding. Besides this, one can optionally use AGA-based analog of the well-known one-time cipher pad scheme [18]. The scheme for such variants of LL is proposed further in Table 9 as variant (a) for the documenting of g tasks, transmitted by phrases composed of \(g\) parts and including check coefficients,\(\mathrm{C_{1,m-1}^{K,header}}\), \(\mathrm{C_{2,m-1}^{K,content}}\), \(\ldots\), \(\mathrm{C_{g,m-1}^{K,total}}\). Such variants can document digital tracks of an agent's activity without disclosing obtained physical parameters. In order to raise the variability of data, one should involve total check coefficients, \(C_{i,j}^{K}\), used in all content parts of phrases. Note that coefficients \(C_{i,j}^{K}\) contain randomly assigned hash values besides predictable work parameters. Such version (b) of LL in Table 9 is designated for dialog communications of agents, if intensive replication of instructions or data is undesirable due to unreliable network, weak hardware, financial motives, or commercial and technology secrets. Eq. (10) shows the formal logic notation of the truth table, given as case (b) in Table 9.

\[ \begin{array}{l}h^{(out)}=\\ h^{(1,1)}\star X_{m}(1,1)\star X_{t}(1_{t},1_{t})\star X_{C,1,1}(C_{1,1},C_{1,1 })\star\ldots\star X_{C,g,1}\big{(}C_{g,1},C_{g,1}\big{)}\star X_{h,1,1}(h_{1,1 },h_{1,1})\star X_{C,1,2}(C_{1,2},C_{1,2})\star\\ \ldots\star X_{C,g,2}\big{(}C_{g,2},C_{g,2}\big{)}\star X_{h,1,2}(h_{1,2},h_{1,2})+\ldots+h^{(m-1,1)}\star X_{m}(m-1,m-1)\star X_{t}(t_{m-1},t_{m-1})\star\\ \mathrm{X_{C,1,m-2}}(C_{1,m-2},C_{1,m-2})\star\ldots\star X_{C,g,m-2}(C_{g,m-2 },C_{g,m-2})\star X_{h,1,m-2}(h_{1,m-2},h_{1,m-2})\star\\ \mathrm{X_{C,1,m-1}}(C_{1,m-1},C_{1,m-1})\star\ldots\star X_{C,g,m-1}\big{(}C_ {g,m-1},C_{g,m-1}\big{)}\star X_{h,1,m-1}(C_{1,m-1},C_{1,m-1})+h^{(m,1)}\star X _{m}(m,m)\star\\ \mathrm{X_{t}}(t_{m},t_{m})\star X_{C,1,m-1}(C_{1,m-1},C_{1,m-1})\star\ldots \star X_{C,g,m-1}\big{(}C_{g,m-1},C_{g,m-1}\big{)}\star X_{h,m,m-1}(h_{m,m-1},h_{m,m-1})\star\\ \mathrm{X_{C,1,m}}(C_{1,m},C_{1,m})\star\ldots\star X_{C,g,m}\big{(}C_{g,m},C_ {g,m}\big{)}\star X_{h,m,m}(h_{m,m},h_{m,m})\end{array}  \tag{10}\]

Note that the process of such expression uses only auxiliary check coefficients without physical parameters and does not need additional truth tables [68; 69], but the vocabulary structure of agents should contain corresponding coded words.