The monadic second-order logic of graphs. I. recognizable sets of finite graphs
Information and Computation
Complexity and expressive power of logic programming
ACM Computing Surveys (CSUR)
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
Graph-based Knowledge Representation: Computational Foundations of Conceptual Graphs
Graph-based Knowledge Representation: Computational Foundations of Conceptual Graphs
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
Extending decidable cases for rules with existential variables
IJCAI'09 Proceedings of the 21st international jont conference on Artifical intelligence
LICS '10 Proceedings of the 2010 25th Annual IEEE Symposium on Logic in Computer Science
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
Ontological query answering with existential rules
RR'11 Proceedings of the 5th international conference on Web reasoning and rule systems
Towards farsighted dependencies for existential rules
RR'11 Proceedings of the 5th international conference on Web reasoning and rule systems
A general Datalog-based framework for tractable query answering over ontologies
Web Semantics: Science, Services and Agents on the World Wide Web
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
Proceedings of the VLDB Endowment
Towards more expressive ontology languages: The query answering problem
Artificial Intelligence
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
Ontology-based data access: a study through disjunctive datalog, CSP, and MMSNP
Proceedings of the 32nd symposium on Principles of database systems
Flag & check: data access with monadically defined queries
Proceedings of the 32nd symposium on Principles of database systems
Querying the guarded fragment with transitivity
ICALP'13 Proceedings of the 40th international conference on Automata, Languages, and Programming - Volume Part II
Kiabora: an analyzer of existential rule bases
RR'13 Proceedings of the 7th international conference on Web Reasoning and Rule Systems
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
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
Taming the infinite chase: query answering under expressive relational constraints
Journal of Artificial Intelligence Research
| Hi-index | 0.00 |
We establish complexities of the conjunctive query entailment problem for classes of existential rules (i.e. Tuple-Generating Dependencies or Datalog+/- rules). Our contribution is twofold. First, we introduce the class of greedy bounded treewidth sets (gbts), which covers guarded rules, and their known generalizations, namely (weakly) frontier-guarded rules. We provide a generic algorithm for query entailment with gbts, which is worst-case optimal for combined complexity with bounded predicate arity, as well as for data complexity. Second, we classify several gbts classes, whose complexity was unknown, namely frontier-one, frontier-guarded and weakly frontier-guarded rules, with respect to combined complexity (with bounded and unbounded predicate arity) and data complexity.