6 citations · 12 across the 5 of their papers we have counts for
5 papers · 1 filter
Modular Materialisation of Datalog Programs
Pan Hu, Boris Motik, Ian Horrocks
The seminaïve algorithm can materialise all consequences of arbitrary datalog rules, and it also forms the basis for incremental algorithms that update a materialisation as the inp…
Stratified Negation in Limit Datalog Programs
Mark Kaminski, Bernardo Cuenca Grau, Egor V. Kostylev +2
There has recently been an increasing interest in declarative data analysis, where analytic tasks are specified using a logical language, and their implementation and optimisation…
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…
Extending Consequence-Based Reasoning to SRIQ
Andrew Bate, Boris Motik, Bernardo Cuenca Grau +2
Consequence-based calculi are a family of reasoning algorithms for description logics (DLs), and they combine hypertableau and resolution in a way that often achieves excellent per…
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…