Search Results for author:
Found 3 papers, 0 papers with code
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.
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.
Cannot find the paper you are looking for? You can
Submit a new open access paper.
