Mapping between Ontologies in Agent Communication

Kód výsledku v IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F68407700%3A21230%2F03%3A03087916" target="_blank" >RIV/68407700:21230/03:03087916 - isvavai.cz</a>

Výsledek na webu

—

DOI - Digital Object Identifier

—

Jazyk výsledku

angličtina

Název v původním jazyce

Mapping between Ontologies in Agent Communication

Popis výsledku v původním jazyce

One of the most important issues in the area of agent communication in the understanding of message content meaning. The meaning is captured in message ontology. In the "open" multi-agent systems we cannot guarantee that all agents share the used ontologies completely. To enable communication, messages must be translated from one ontology to the other one. We propose an algorithm for establishing a mapping between ontologies and describe how the mapping is used for translation of messages between different ontologies. The approach relies on a posibility to point to objects in the world that agents share. The process of refining the mapping is iterative and knowledge gained at any step can be used for translation. The proposed algorithm permits a certain information loss (e.g. when the source ontology is more detailed than the target one) but always provides a consistent translation.

Název v anglickém jazyce

Mapping between Ontologies in Agent Communication

Popis výsledku anglicky

One of the most important issues in the area of agent communication in the understanding of message content meaning. The meaning is captured in message ontology. In the "open" multi-agent systems we cannot guarantee that all agents share the used ontologies completely. To enable communication, messages must be translated from one ontology to the other one. We propose an algorithm for establishing a mapping between ontologies and describe how the mapping is used for translation of messages between different ontologies. The approach relies on a posibility to point to objects in the world that agents share. The process of refining the mapping is iterative and knowledge gained at any step can be used for translation. The proposed algorithm permits a certain information loss (e.g. when the source ontology is more detailed than the target one) but always provides a consistent translation.

Druh

D - Stať ve sborníku

CEP obor

JC - Počítačový hardware a software

OECD FORD obor

—

Projekt

—

Návaznosti

Z - Vyzkumny zamer (s odkazem do CEZ)

Rok uplatnění

2003

Kód důvěrnosti údajů

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

Název statě ve sborníku

Multi-Agent Systems and Applications III

ISBN

3-540-40450-3

ISSN

—

e-ISSN

—

Počet stran výsledku

13

Strana od-do

191-203

Název nakladatele

Springer

Místo vydání

Heidelberg

Místo konání akce

Praha

Datum konání akce

16. 6. 2003

Typ akce podle státní příslušnosti

EUR - Evropská akce

Kód UT WoS článku

—