MiniCon: A scalable algorithm for answering queries using views
The VLDB Journal — The International Journal on Very Large Data Bases
Answering queries using views: A survey
The VLDB Journal — The International Journal on Very Large Data Bases
Tractable Reasoning and Efficient Query Answering in Description Logics: The DL-Lite Family
Journal of Automated Reasoning
Queries and updates in the coDB peer to peer database system
VLDB '04 Proceedings of the Thirtieth international conference on Very large data bases - Volume 30
Inconsistency tolerance in P2P data integration: An epistemic logic approach
Information Systems
Distributed reasoning in a peer-to-peer setting: application to the semantic web
Journal of Artificial Intelligence Research
Aspects of distributed and modular ontology reasoning
IJCAI'05 Proceedings of the 19th international joint conference on Artificial intelligence
Journal on data semantics VIII
The semantics of consistency and trust in peer data exchange systems
LPAR'07 Proceedings of the 14th international conference on Logic for programming, artificial intelligence and reasoning
Non-conservative extension of a peer in a P2P inference system
AI Communications
| Hi-index | 0.00 |
This paper provides a decentralized data model and associated algorithms for peer data management systems (PDMS) based on the DL-LITER description logic. Our approach relies on reducing query reformulation and consistency checking for DL-LITER into reasoning in propositional logic. This enables a straightforward deployment of DL-LITER PDMSs on top of Some Where, a scalable propositional peer-to-peer inference system. We also show how to use the state-of-the-art Minicon algorithm for rewriting queries using views in DL-LITER in the centralized and decentralized cases.