A Proof Procedure for Data Dependencies
Journal of the ACM (JACM)
Conceptual structures: information processing in mind and machine
Conceptual structures: information processing in mind and machine
Foundations of Databases: The Logical Level
Foundations of Databases: The Logical Level
Reformulation of XML Queries and Constraints
ICDT '03 Proceedings of the 9th International Conference on Database Theory
Data Exchange: Semantics and Query Answering
ICDT '03 Proceedings of the 9th International Conference on Database Theory
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
The Implication Problem for Data Dependencies
Proceedings of the 8th Colloquium on Automata, Languages and Programming
Embedded implicational dependencies and their inference problem
STOC '81 Proceedings of the thirteenth annual ACM symposium on Theory of computing
Data exchange: semantics and query answering
Theoretical Computer Science - Database theory
Tractable Reasoning and Efficient Query Answering in Description Logics: The DL-Lite Family
Journal of Automated Reasoning
Proceedings of the twenty-seventh ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Graph-based Knowledge Representation: Computational Foundations of Conceptual Graphs
Graph-based Knowledge Representation: Computational Foundations of Conceptual Graphs
Generalized schema-mappings: from termination to tractability
Proceedings of the twenty-eighth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
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
Complexity boundaries for horn description logics
AAAI'07 Proceedings of the 22nd national conference on Artificial intelligence - Volume 1
Extensions of simple conceptual graphs: the complexity of rules and constraints
Journal of Artificial Intelligence Research
IJCAI'05 Proceedings of the 19th international joint conference on Artificial intelligence
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
On chase termination beyond stratification
Proceedings of the VLDB Endowment
Query answering under non-guarded rules in datalog+/-
RR'10 Proceedings of the Fourth international conference on Web reasoning and rule systems
Datalog+/-: A Family of Logical Knowledge Representation and Query Languages for New Applications
LICS '10 Proceedings of the 2010 25th Annual IEEE Symposium on Logic in Computer Science
On rules with existential variables: Walking the decidability line
Artificial Intelligence
Rules dependencies in backward chaining of conceptual graphs rules
ICCS'06 Proceedings of the 14th international conference on Conceptual Structures: inspiration and Application
Walking the complexity lines for generalized guarded existential rules
IJCAI'11 Proceedings of the Twenty-Second international joint conference on Artificial Intelligence - Volume Volume Two
Computing stable models for nonmonotonic existential rules
IJCAI'13 Proceedings of the Twenty-Third international joint conference on Artificial Intelligence
Acyclicity notions for existential rules and their application to query answering in ontologies
Journal of Artificial Intelligence Research
| Hi-index | 0.00 |
We consider existential rules (also called Tuple-Generating Dependencies or Datalog+/- rules). These rules are particularly well-suited to the timely ontological query answering problem, which consists of querying data while taking terminological knowledge into account. Since this problem is not decidable in general, various conditions ensuring decidability have been proposed in the literature. In this paper, we focus on conditions that restrict the way rules may interact to ensure that the forward chaining mechanism is finite. After a review of existing proposals, we propose a generalization of the notion of rule dependency, namely k-dependency, that allows to enlarge halting cases. It can also be used to compile the rule base, which leads to improve query answering algorithms.