Conflict resolution in multi-agent systems with typed relations for ontology population


如何引用文章

全文:

开放存取 开放存取
受限制的访问 ##reader.subscriptionAccessGranted##
受限制的访问 订阅存取

详细

The paper presents a conflict resolution algorithm for multi-agent systems with agents connected by relations of different types and worth. The result of conflict resolution is a conflict-free set of agents. We apply this algorithm for the ambiguity resolution problem in ontology population based on multiagent natural language text analysis.

作者简介

N. Garanina

A. P. Ershov Institute of Informatics Systems, Siberian Division

编辑信件的主要联系方式.
Email: garanina@iis.nsk.su
俄罗斯联邦, pr. Akademika Lavrent’eva 6, Novosibirsk, 630090

E. Sidorova

A. P. Ershov Institute of Informatics Systems, Siberian Division

Email: garanina@iis.nsk.su
俄罗斯联邦, pr. Akademika Lavrent’eva 6, Novosibirsk, 630090

I. Anureev

A. P. Ershov Institute of Informatics Systems, Siberian Division

Email: garanina@iis.nsk.su
俄罗斯联邦, pr. Akademika Lavrent’eva 6, Novosibirsk, 630090

补充文件

附件文件
动作
1. JATS XML

版权所有 © Pleiades Publishing, Ltd., 2016