## 3 Results: AGA Logic Variables for Scene Description and Dialog Communications
### Communication Module and the Dialog Protocol
Nevertheless, the simple model procedure to verify license ID in dialog mode gives the possibility to demonstrate the interrelation of proposed AGA components as the procedure consisting of five basic steps, which are briefly disclosed in Sections 4.1-4.5. Figure 11: Formation of the AGA-based LL. ### Step 1: Definition of Necessary Coded Words

In order to understand requests and replies in the dialog mode, the inspecting regulator's agent, the delivering agent, and the service terminal in the pair should contain the same coded words in their vocabularies' structures. These coded words should describe (1) the license number (noun), (2) data extraction procedure from the LL (verb), (3) hash values (numbers) to receive data from the storage, and (4) auxiliary data, used as formal descriptors of requested content. The last category refers to, e.g., parameters \(v\) and \(m\), tagging vocabularies. Approving quasi-random hash values are used here as access keys [68; 69] in order to avoid frequently repeated codes and possible prompts to cheaters. Such terminology should be first defined as words of natural language, given in the basic vocabulary, \(V^{L}\). After this, terms should be represented as natural number-code words, \(w_{N}^{v,\text{m}}\), and further as truth-level codes, \(w_{K}^{v,\text{m}}\). An example of three conjugated coded words is given below in the Table 7, given with arbitrarily chosen numbers used in other examples, as the holistic vocabulary structure is to be given for a specific task and hardware platform. However, such sets of valuable bound parameters can be written to LL local storage, installed in a specialized unmanned terminal shown in Figure 12. Following the above-discussed common 8-byte data format for dialog phrases, data for LL should be grouped into entries with the length of eight 8-byte numbers. However, such formation should be additionally coordinated with the formation of chain words in the vocabulary's structure. \begin{table}
\begin{tabular}{c c c c c c c} \hline \hline \multicolumn{2}{c}{**“Extract Word\"**} & & & & & & \\ \hline Number of rows & Number of & Word code in & Word code in & Word code in & Addresser’s & Sender’s \\ in vocabulary matrix, & columns in & natural language & natural-number & truth levels = & approving hash & \(\text{h}_{v,\text{m}}=242\) \\ \(\text{v}=1\) & vocabulary & \(=\text{w}_{1,8}^{\text{L}}=\text{s}\) & code = \(\text{w}_{1,8}^{\text{N}}\) & \(\text{w}_{1,8}^{\text{K}}=175\) & & \(\text{h}_{v,\text{m}}=34\) & \\ \hline \multicolumn{2}{c}{“License ID”} & & & & & & \\ \hline Number of rows & Number of & Word code in & Word code in & Word code in & Addresser’s & Sender’s \\ in vocabulary matrix, & columns in & natural language & natural-number & truth levels = & approving hash & \(\text{h}_{v,\text{m}}=101\) \\ \(\text{v}=1\) & vocabulary & \(=\text{w}_{1,9}^{\text{L}}=\text{s}\) & code = \(\text{w}_{1,9}^{\text{N}}\) & \(\text{w}_{1,9}^{\text{K}}=207\) & & \(\text{h}_{v,\text{m}}=11\) \\ \(\text{v}=1\) & matrix, m = 9 & “license ID” & \(=\text{23}\) & & & \\ \hline \hline \end{tabular}
\end{table} 
Table 7: Necessary set of coded words to be written in the vocabulary’s structure. Figure 12: Possible practical application for the verification of authenticity and credentials. Data procession combines AGA calculations, local LL data storages, and dialog communications of unmanned robots. Autonomous state or corporative regulator’s agent checks license number ID and freight parameters received from unmanned delivering agents and terminals. ### Step 2: Formation of Request Phrases, Compatible with the LL Format

The overall procession procedure for such a phrase is shown in Section 3 and Algorithm 1. This protocol is simple enough and available to microassembler and 8-bit platform, described in Section 6. The considered procedures do not involve a decision-making module, which is supposed to concentrate on more complicated AI schemes for phrase procession.