Publications (22)
Rewriting the Infinite Chase
Michael Benedikt, Maxime Buron, Stefano Germano +2
Guarded tuple-generating dependencies (GTGDs) are a natural extension of description logics and referential constraints. It has long been known that queries over GTGDs can be answe…
Goal-Driven Query Answering for Existential Rules with Equality
Michael Benedikt, Boris Motik, Efthymia Tsamoura
Inspired by the magic sets for Datalog, we present a novel goal-driven approach for answering queries over terminating existential rules with equality (aka TGDs and EGDs). Our tech…
Completeness Guarantees for Incomplete Ontology Reasoners: Theory and Practice
Bernardo Cuenca Grau, Boris Motik, Giorgos Stoilos +1
To achieve scalability of query answering, the developers of Semantic Web applications are often forced to use incomplete OWL 2 reasoners, which fail to derive all answers for at l…
Goal-Driven Query Answering over First- and Second-Order Dependencies with Equality
Efthymia Tsamoura, Boris Motik
In this paper we present the first goal-driven query answering technique for first- and second-order dependencies with equality. Our technique transforms the input dependencies so…
Hypertableau Reasoning for Description Logics
Boris Motik, Rob Shearer, Ian Horrocks
We present a novel reasoning calculus for the description logic SHOIQ^+---a knowledge representation formalism with applications in areas such as the Semantic Web. Unnecessary nond…
Introducing Nominals to the Combined Query Answering Approaches for EL
Giorgio Stefanoni, Boris Motik, Ian Horrocks
So-called combined approaches answer a conjunctive query over a description logic ontology in three steps: first, they materialise certain consequences of the ontology and the data…