Reasoning about knowledge
Tolerance approximation spaces
Fundamenta Informaticae - Special issue: rough sets
Modal logic
Rough Sets: Theoretical Aspects of Reasoning about Data
Rough Sets: Theoretical Aspects of Reasoning about Data
Epistemic Logic for AI and Computer Science
Epistemic Logic for AI and Computer Science
Rough-Fuzzy Hybridization: A New Trend in Decision Making
Rough-Fuzzy Hybridization: A New Trend in Decision Making
Dynamic Logic
Introduction to Algorithms
A Generalized Definition of Rough Approximations Based on Similarity
IEEE Transactions on Knowledge and Data Engineering
Fundamenta Informaticae
Concept Learning with Approximation: Rough Version Spaces
TSCTC '02 Proceedings of the Third International Conference on Rough Sets and Current Trends in Computing
Theoretical Computer Science
Knowledge Representation Techniques (Studies in Fuzziness and Soft Computing)
Knowledge Representation Techniques (Studies in Fuzziness and Soft Computing)
Communication between agents with heterogeneous perceptual capabilities
Information Fusion
A Tuning Machine for Cooperative Problem Solving
Fundamenta Informaticae - Multiagent Systems (FAMAS'03)
Generalized rough approximations in Ł Π12
International Journal of Approximate Reasoning
Generalized fuzzy rough approximation operators based on fuzzy coverings
International Journal of Approximate Reasoning
A comparison of two types of rough sets induced by coverings
International Journal of Approximate Reasoning
Data complexity of reasoning in very expressive description logics
IJCAI'05 Proceedings of the 19th international joint conference on Artificial intelligence
Horn Knowledge Bases in Regular Description Logics with PTIME Data Complexity
Fundamenta Informaticae
On the web ontology rule language OWL 2 RL
ICCCI'11 Proceedings of the Third international conference on Computational collective intelligence: technologies and applications - Volume Part I
Agents in approximate environments
Games, Actions and Social Software
HornDL: an expressive horn description logic with PTime data complexity
RR'13 Proceedings of the 7th international conference on Web Reasoning and Rule Systems
Hi-index | 0.00 |
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.