LiU Electronic Press
Full-text not available in DiVA
Author:
Dunin-Keplicz, Barbara ( University of Warsaw)
Anh Nguyen, Linh ( University of Warsaw)
Szalas, Andrzej (Linköping University, Department of Computer and Information Science, KPLAB - Knowledge Processing Lab) (Linköping University, The Institute of Technology)
Title:
Tractable approximate knowledge fusion using the Horn fragment of serial propositional dynamic logic
Department:
Linköping University, Department of Computer and Information Science, KPLAB - Knowledge Processing Lab
Linköping University, The Institute of Technology
Publication type:
Article in journal (Refereed)
Language:
English
Publisher: Elsevier
Status:
Published
In:
International Journal of Approximate Reasoning(ISSN 0888-613X)(EISSN 1873-4731)
Volume:
51
Issue:
3
Pages:
346-362
Year of publ.:
2010
URI:
urn:nbn:se:liu:diva-54706
Permanent link:
http://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-54706
ISI:
000275610600005
Subject category:
Engineering and Technology
SVEP category:
TECHNOLOGY
Keywords(en) :
Rough sets, Similarity relation, Dynamic logic, Knowledge fusion, Approximate database
Abstract(en) :

In this paper we investigate a technique for fusing approximate knowledge obtained from distributed, heterogeneous information sources. This issue is substantial, e.g., in modeling multiagent systems, where a group of loosely coupled heterogeneous agents cooperate in achieving a common goal. Information exchange, leading ultimately to knowledge fusion, is a natural and vital ingredient of this process. We use a generalization of rough sets and relations [30], which depends on allowing arbitrary similarity relations. The starting point of this research is [6], where a framework for knowledge fusion in multiagent systems is introduced. Agents individual perceptual capabilities are represented by similarity relations, further aggregated to express joint capabilities of teams, This aggregation, expressing a shift from individual to social level of agents activity, has been formalized by means of dynamic logic. The approach of Doherty et al. (2007) [6] uses the full propositional dynamic logic, which does not guarantee tractability of reasoning. Our idea is to adapt the techniques of Nguyen [26-28] to provide an engine for tractable approximate database querying restricted to a Horn fragment of serial dynamic logic. We also show that the obtained formalism is quite powerful in applications.

Available from:
2010-04-06
Created:
2010-04-06
Last updated:
2011-02-24
Statistics:
12 hits