Search Results for author:
Found 12 papers, 0 papers with code
Query Rewriting with Disjunctive Existential Rules and Mappings
Finally, turning our attention to mappings, we show that the problem of determining whether a UCQ admits a UCQ-rewriting through a disjunctive mapping is undecidable.
Normalisations of Existential Rules: Not so Innocuous!
Existential rules are an expressive knowledge representation language mainly developed to query data.
Parallelisable Existential Rules: a Story of Pieces
We show that parallelisable rule sets are exactly those rule sets both bounded for the chase and belonging to a novel class of rules, called pieceful.
Oblivious and Semi-Oblivious Boundedness for Existential Rules
We study the notion of boundedness in the context of positive existential rules, that is, whether there exists an upper bound to the depth of the chase procedure, that is independent from the initial instance.
Characterizing Boundedness in Chase Variants
A set of existential rules is bounded if it ensures the existence of a bound on the depth of the chase, independently from any set of facts.
On the k-Boundedness for Existential Rules
Given a chase variant, the halting problem takes as input a set of existential rules and asks if this set of rules ensures the termination of the chase for any factbase.
A General Modifier-based Framework for Inconsistency-Tolerant Query Answering
We propose a general framework for inconsistency-tolerant query answering within existential rule setting.
Combining Existential Rules and Transitivity: Next Steps
In this paper, we address the issue of whether transitivity can be safely combined with decidable classes of existential rules.
Worst-case Optimal Query Answering for Greedy Sets of Existential Rules and Their Subclasses
We provide a generic algorithm for query entailment under gbts, which is worst-case optimal for combined complexity with or without bounded predicate arity, as well as for data complexity and query complexity.
Extending Acyclicity Notions for Existential Rules (\emph{long version})
Existential rules have been proposed for representing ontological knowledge, specifically in the context of Ontology-Based Query Answering.
Revisiting Chase Termination for Existential Rules and their Extension to Nonmonotonic Negation
Existential rules have been proposed for representing ontological knowledge, specifically in the context of Ontology- Based Data Access.
Sound, Complete and Minimal UCQ-Rewriting for Existential Rules
Then, we focus on piece-unifiers, which provide a rewriting operator with the desired properties.
