LiU Electronic Press
Full-text not available in DiVA
Author:
Dunin-Keplicz, Barbara (Warsaw University)
Nguyen, Linh Anh (Warsaw University)
Szalas, Andrzej (Linköping University, Department of Computer and Information Science, KPLAB - Knowledge Processing Lab) (Linköping University, The Institute of Technology)
Title:
Fusing Approximate Knowledge from Distributed Sources
Department:
Linköping University, Department of Computer and Information Science, KPLAB - Knowledge Processing Lab
Linköping University, The Institute of Technology
Publication type:
Conference paper (Refereed)
Language:
English
In:
Proceedings of the 3rd International Symposium on Intelligent Distributed Computing (IDC)
Conference:
3rd International Symposium on Intelligent Distributed Computing (IDC), Ayia Napa, Cyprus, October, 2009
Publisher: Springer Berlin/Heidelberg
Series:
Studies in Computational Intelligence, ISSN 1860-949X; 237
Volume:
237
Pages:
75-86
Year of publ.:
2009
URI:
urn:nbn:se:liu:diva-74987
Permanent link:
http://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-74987
ISBN:
978-3-642-03213-4, 978-3-642-26930-1
Subject category:
Engineering and Technology
Abstract(en) :

In this paper we investigate a technique for fusing approximate knowledge obtained from distributed, heterogeneous information sources. We use a generalization of rough sets and relations [14], which depends on allowing arbitrary similarity relations. The starting point of this research is [2], where a framework for knowledge fusion in multi-agent systems is introduced. Agent’s individual perceptual capabilities are represented by similarity relations, further aggregated to express joint capabilities of teams. This aggregation, allowing a shift from individual to social level, has been formalized by means of dynamic logic. The approach of [2] uses the full propositional dynamic logic, not guaranteeing the tractability of reasoning. Therefore the results of [11, 12, 13] are adapted to provide a technical engine for tractable approximate database querying restricted to a Horn fragment of serial PDL. We also show that the obtained formalism is quite powerful in applications.

Available from:
2012-02-13
Created:
2012-02-13
Last updated:
2012-02-21
Statistics:
15 hits