The monadic second-order logic of graphs. I. recognizable sets of finite graphs
Information and Computation
Testing implications of data dependencies
ACM Transactions on Database Systems (TODS)
Journal of the ACM (JACM)
Testing containment of conjunctive queries under functional and inclusion dependencies
PODS '82 Proceedings of the 1st ACM SIGACT-SIGMOD symposium on Principles of database systems
Reformulation of XML Queries and Constraints
ICDT '03 Proceedings of the 9th International Conference on Database Theory
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
A comparison of two modelling paradigms in the Semantic Web
Web Semantics: Science, Services and Agents on the World Wide Web
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
Extending decidable cases for rules with existential variables
IJCAI'09 Proceedings of the 21st international jont conference on Artifical intelligence
Query answering under non-guarded rules in datalog+/-
RR'10 Proceedings of the Fourth international conference on Web reasoning and rule systems
Advanced processing for ontological queries
Proceedings of the VLDB Endowment
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
FOSSACS'12 Proceedings of the 15th international conference on Foundations of Software Science and Computational Structures
On the complexity of ontological reasoning under disjunctive existential rules
MFCS'12 Proceedings of the 37th international conference on Mathematical Foundations of Computer Science
Existential rules: a graph-based view
Datalog 2.0'12 Proceedings of the Second international conference on Datalog in Academia and Industry
A broad class of first-order rewritable tuple-generating dependencies
Datalog 2.0'12 Proceedings of the Second international conference on Datalog in Academia and Industry
Query patterns for existential rules
RR'12 Proceedings of the 6th international conference on Web Reasoning and Rule Systems
A sound and complete backward chaining algorithm for existential rules
RR'12 Proceedings of the 6th international conference on Web Reasoning and Rule Systems
Data complexity of query answering in description logics
Artificial Intelligence
Querying the guarded fragment with transitivity
ICALP'13 Proceedings of the 40th international conference on Automata, Languages, and Programming - Volume Part II
On the exploration of the query rewriting space with existential rules
RR'13 Proceedings of the 7th international conference on Web Reasoning and Rule Systems
RW'13 Proceedings of the 9th international conference on Reasoning Web: semantic technologies for intelligent data access
The impact of disjunction on query answering under guarded-based existential rules
IJCAI'13 Proceedings of the Twenty-Third international joint conference on Artificial Intelligence
Computing stable models for nonmonotonic existential rules
IJCAI'13 Proceedings of the Twenty-Third international joint conference on Artificial Intelligence
Sound, complete, and minimal query rewriting for existential rules
IJCAI'13 Proceedings of the Twenty-Third international joint conference on Artificial Intelligence
Ontology based query answering with 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
Taming the infinite chase: query answering under expressive relational constraints
Journal of Artificial Intelligence Research
Hi-index | 0.00 |
Existential rules, i.e. Datalog extended with existential quantifiers in rule heads, are currently studied under a variety of names such as Datalog+/-, ∀∃-rules, and tuple-generating dependencies. The renewed interest in this formalism is fuelled by a wealth of recently discovered language fragments for which query answering is decidable. This paper extends and consolidates two of the main approaches in this field - acyclicity and guardedness - by providing (1) complexity-preserving generalisations of weakly acyclic and weakly (frontier-) guarded rules, and (2) a novel formalism of glut-(frontier-) guarded rules that subsumes both. This builds on an insight that acyclicity can be used to extend any existential rule language while retaining decidability. Besides decidability, combined query complexities are established in all cases.