Sound and Complete Forward and backward Chainingd of Graph Rules
ICCS '96 Proceedings of the 4th International Conference on Conceptual Structures: Knowledge Representation as Interlingua
Tractable Reasoning and Efficient Query Answering in Description Logics: The DL-Lite Family
Journal of Automated Reasoning
A general datalog-based framework for tractable query answering over ontologies
Proceedings of the twenty-eighth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Extending decidable cases for rules with existential variables
IJCAI'09 Proceedings of the 21st international jont conference on Artifical intelligence
Conjunctive query answering in the description logic EL using a relational database system
IJCAI'09 Proceedings of the 21st international jont conference on Artifical intelligence
Efficient Query Answering for OWL 2
ISWC '09 Proceedings of the 8th International Semantic Web Conference
Query answering under non-guarded rules in datalog+/-
RR'10 Proceedings of the Fourth international conference on Web reasoning and rule systems
On rules with existential variables: Walking the decidability line
Artificial Intelligence
Ontological queries: Rewriting and optimization
ICDE '11 Proceedings of the 2011 IEEE 27th International Conference on Data Engineering
Extending decidable existential rules by joining acyclicity and guardedness
IJCAI'11 Proceedings of the Twenty-Second international joint conference on Artificial Intelligence - Volume Volume Two
The combined approach to ontology-based data access
IJCAI'11 Proceedings of the Twenty-Second international joint conference on Artificial Intelligence - Volume Volume Three
A sound and complete backward chaining algorithm for existential rules
RR'12 Proceedings of the 6th international conference on Web Reasoning and Rule Systems
Hi-index | 0.00 |
We address the issue of Ontology-Based Data Access, with ontologies represented in the framework of existential rules, also known as Datalog+/-. A well-known approach involves rewriting the query using ontological knowledge. We focus here on the basic rewriting technique which consists of rewriting a conjunctive query (CQ) into a union of CQs. We assume that the set of rules is a finite unification set, i.e., for any CQ, there exists a finite sound and complete rewriting of this CQ with the rules. First, we study a generic breadth-first rewriting algorithm, which takes as input any rewriting operator. We define properties of the rewriting operator that ensure the correctness and the termination of this algorithm. Second, we study some operators with respect to the exhibited properties. All these operators have in common to be based on so-called piece-unifiers but they lead to different explorations of the rewriting space. Finally, an experimental comparison of these operators within an implementation of the generic breadth-first rewriting algorithm is presented.