## 3 Results: AGA Logic Variables for Scene Description and Dialog Communications
### Communication Module and the Dialog Protocol
\begin{tabular}{l l l} \hline \hline
6 & Assigns addresser's triple name \((w^{K}_{1,4},w^{K}_{2,4},w^{K}_{3,4})\) to the header & ; insert triple \\  & \(W_{\text{ij}}=\{w^{K}_{1,1},w^{K}_{1,2},w^{K}_{1,3},w^{K}_{2,3},w^{K}_{3,3}, \ldots,\ldots,\ldots\}\); & \(V^{K}_{1,3},V^{K}_{2,3},V^{K}_{3,3}\) \\ \hline
7 & Assigns own sender's triple name \((w^{K}_{1,5},w^{K}_{2,5},w^{K}_{3,5})\) to the header & ; insert triple \\  & \(W_{\text{ij}}=\{w^{K}_{1,1},w^{K}_{1,2},w^{K}_{1,4},w^{K}_{2,4},w^{K}_{3,4},w^{K }_{1,5},w^{K}_{2,5},w^{K}_{3,5}\}\); & \(V^{K}_{1,4},V^{K}_{2,4},V^{K}_{3,4}\) \\ \hline
8 & Maps truth levels onto natural numbers scale and calculates total check coefficient, \(C^{K/N}_{ij}\), for the header & ; insert and triple \\  & \(C^{K/N}_{1,1}=\sum\limits_{n=1}^{2}w^{K}_{1,m}+\sum\limits_{n=1}^{3}\sum \limits_{n=3}^{4}w^{K/N}_{5,m}\); & ; number of content parts \\ \hline
9 & Calculates number of content parts: \(N_{C}\geq(r\ x\ s-p\ x\ q)/6;\ N_{C}\in N\), \(p,q,r\), \(s\) are taken from the received content data sequence \(\{w^{K}_{p,4},\ \ldots,w^{K}_{r,s}\}\); & ; number of content parts \\ \hline
10 & & Assigns v = p, m = q & ; set counters of chain \\ \hline
11 & & Assigns \(j=N_{C}\) & ; begin content parts and \\ \hline
12 & & Assigns g = 6 & ; counter of free fields in a \\ \hline
13 & & Writes next hash \(w^{K}_{1,3}\) from the list \(L_{\text{hash}}\) to the first field of phrase content part & ; begin new content part \\  & \(W_{\text{ij}}=\left\{w^{K}_{1,3},\ldots,\ldots,\ldots,\ldots,\ldots,\ldots, \ldots\right\}\); & ; begin new content part \\ \hline
14 & & Goes to step 18 & ; next content part \\ \hline
15 & & Checks if \(m=s\), and if yes, it goes to step 23; & \\  & & otherwise, it goes to step 18. & \\ \hline
16 & & Checks if \(v=r\), and if yes, it goes to step 26; & ;end of phrase formation \\ \hline
17 & & Checks if \(j=0\), and if yes, it goes to step 12; & \\  & & otherwise, it goes to step 25. & \\ \hline
18 & & Write \(w^{K}_{p,4}\) into the next vacancy in the content part, & \\  & \(W_{\text{ij}+1}=\left\{w^{K}_{1,3},w^{K}_{p,4},w^{K}_{p+1,4},w^{K}_{p+2,4}, \ldots,\ldots,\ldots,\ldots,\ldots\right\}\) & \(\text{g = g - 1}\) & ; check for free fields \\ \hline
20 & & Checks if \(g=0\), and if yes, it goes to step 25; & ; \(m+1\) \\ \hline
21 & & \(\text{m}=\text{m}+1\) & \\ \hline
22 & & Goes to step 15 & \\ \hline
23 & & \(\text{v}=\text{v}+1\) & ; process next \(v\) \\ \hline
24 & & Goes to step 16 & \\ \hline \hline \end{tabular}   
Maps truth levels onto the natural numbers scale and calculates total coefficient, \(C^{K}_{i,2}\),  
of the content part  
\[C^{K/N}_{ij}=\left( \begin{subarray}{c}\text{h}^{\text{eff}}_{ij}+\frac{4}{v}- \sum\limits_{p=p}^{K}\frac{5}{w}\sum\limits_{n=r}^{K/N}w^{K/N}_{ij,n}\\ \end{subarray} \right)_{\text{\scriptsize\emph{contout part}}}\]  
Calculates total summation \(C^{K/N}_{total}=C^{K}_{1,1}+\sum\limits_{i=2}^{N_{C}}\sum\limits_{i,j}^{N_{C}}C^{ K/N}_{ij}\)  
Writes \(C^{K/N}_{total}\) into the current content part of phrase  
\[W_{\text{ij}}=\left\{w^{K}_{1,3},w^{K}_{p,m},w^{K}_{p,m},w^{K}_{p,m},w^{K}_{p,m}, w^{K}_{p,m},w^{K}_{p,m},w^{K}_{p,m},w^{K}_{p,m},\text{C}^{K/N  
```

**Algorithm 1**Cont. Besides the correct content part, the receiving buffer of agent potentially can contain, by mistake, some excessive illegally sent parts or ones taken from someone else's message. Its analysis is based on the simple summation of mapped truth levels and the comparison of total check coefficients, obtained by the addresser and declared by the sender. This



more reliable procedures for classic and quantum cryptography, AGA procedures can be analyzed and checked directly by the user. Earlier proposed versions of AGA-based LL [68; 69] and proposed further adapted ones use different parameters and numbers of variables; however, all of them correspond to the basic block-scheme shown in Figure 11. It demonstrates the procedure to form the new notation for the LL, which is the last added product term in the corresponding expression of AGA function.