Complexity of answering queries using materialized views
PODS '98 Proceedings of the seventeenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Representing and reasoning about mappings between domain models
Eighteenth national conference on Artificial intelligence
Answering queries using views: A KRDB perspective for the semantic Web
ACM Transactions on Internet Technology (TOIT)
Knowledge compilation using theory prime implicates
IJCAI'95 Proceedings of the 14th international joint conference on Artificial intelligence - Volume 1
Theorem proving with structured theories
IJCAI'01 Proceedings of the 17th international joint conference on Artificial intelligence - Volume 1
Information Systems - Special issue: The semantic web and web services
Instance assisted ontology alignment for digital museums
SMO'07 Proceedings of the 7th WSEAS International Conference on Simulation, Modelling and Optimization
A TRIPLE-Oriented Approach for Integrating Higher-Order Rules and External Contexts
RR '08 Proceedings of the 2nd International Conference on Web Reasoning and Rule Systems
A Segmentation-Based Approach for Approximate Query over Distributed Ontologies
ASWC '08 Proceedings of the 3rd Asian Semantic Web Conference on The Semantic Web
Distributed reasoning in a peer-to-peer setting: application to the semantic web
Journal of Artificial Intelligence Research
A web-centric semantic mediation approach for spatial information systems
Journal of Visual Languages and Computing
Instance migration in heterogeneous ontology environments
ISWC'07/ASWC'07 Proceedings of the 6th international The semantic web and 2nd Asian conference on Asian semantic web conference
Design and implementation of P2P reasoning system based on description logic
International Journal of Ad Hoc and Ubiquitous Computing
Hi-index | 0.00 |
This article presents a simple but scalable framework for peer-to-peer data-sharing systems, in which the problem of answering queries over a network of semantically related peers is always decidable. The authors' approach is characterized by a simple class-based language for defining peer schemas as hierarchies of atomic classes, and mappings as inclusions of logical combinations of atomic classes. They provide an anytime and incremental method for computing all the answers to a query posed to a given peer such that the answers are ordered from ones involving peers close to the queried peer to those involving more distant peers.