Modelling dynamic behaviour of agents in a multi-agent system; Logical analysis of Wh-questions and answers.

Result code in IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F61989100%3A27240%2F23%3A10251750" target="_blank" >RIV/61989100:27240/23:10251750 - isvavai.cz</a>

Result on the web

<a href="https://academic.oup.com/jigpal/article-abstract/31/1/140/6515541?redirectedFrom=fulltext&login=true" target="_blank" >https://academic.oup.com/jigpal/article-abstract/31/1/140/6515541?redirectedFrom=fulltext&login=true</a>

DOI - Digital Object Identifier

<a href="http://dx.doi.org/10.1093/jigpal/jzab034" target="_blank" >10.1093/jigpal/jzab034</a>

Result language

angličtina

Original language name

Modelling dynamic behaviour of agents in a multi-agent system; Logical analysis of Wh-questions and answers.

Original language description

In a multiagent and multi-cultural world, the fine-grained analysis of agents&apos; dynamic behaviour, i.e. of their activities, is essential. Dynamic activities are actions that are characterised by an agent who executes the action and by other participants of the action. Wh-questions on the participants of the actions pose a difficult particular challenge because the variability of the types of possible answers to such questions is huge. To deal with the problem, we propose the analysis and classification of Wh-questions apt for agents&apos; communication in a multiagent system. Our proposal of such a system consists of agents who communicate with their fellow agents by messaging so that each autonomous agent, though resource-bounded, can make less or more rational decisions to meet its own and collective goals. In addition, by communicating with other fellow agents and their environment, agents can learn new concepts and enrich their ontology so that their behaviour is dynamic. We aim to make a general proposal of the system so that the &apos;envelope&apos; of agents&apos; messages can be formalised in any MAS standard, be it FIPA ACL or KQML. Yet, the content of messages is encoded in a formalised natural language. To this end, we apply Transparent Intensional Logic (TIL) with its procedural semantics that is particularly apt for a fine-grained analysis in which all the semantically salient features of natural language can be plausibly formalised. In this paper, we concentrate on analysing the content of query messages, particularly the content of those that encode Wh-questions and the answers to them. We also summarise TIL deduction system that makes it possible to answer such questions in an intelligent way. Linguists distinguish several subtypes of Wh-questions. Though the linguistic classification is helpful, it is not always suitable for agents&apos; communication and reasoning. We need the classification based on a logical analysis of Wh-questions so that the agents can infer possible answers to such questions rather than only looking for them by keywords. This paper aims to apply an appropriate classification of the logical types of Wh-questions and the analysis of such questions; we concentrate in particular on questions concerning the participants of activities. The application of these results to the analysis of processes and events based on verb valency frames is another novelty of the paper.

Czech name

—

Czech description

—

Type

J_imp - Article in a specialist periodical, which is included in the Web of Science database

CEP classification

—

OECD FORD branch

10200 - Computer and information sciences

Project

—

Continuities

S - Specificky vyzkum na vysokych skolach

Publication year

2023

Confidentiality

S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Name of the periodical

Logic journal of IGPL

ISSN

1367-0751

e-ISSN

1368-9894

Volume of the periodical

31

Issue of the periodical within the volume

1

Country of publishing house

GB - UNITED KINGDOM

Number of pages

32

Pages from-to

140-171

UT code for WoS article

001121586500006

EID of the result in the Scopus database

2-s2.0-85146985883