activity
20132017
most citedCombining Rewriting and Incremental Materialisation Maintenance for Datalog Programs with Equality

6 citations · 11 across the 3 of their papers we have counts for

collaborators

5 papers

cs.AI20173 cited

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…

cs.DB20172 cited

Optimised Maintenance of Datalog Materialisations

Pan Hu, Boris Motik, Ian Horrocks

To efficiently answer queries, datalog systems often materialise all consequences of a datalog program, so the materialisation must be updated whenever the input facts change. Seve…

cs.AI2016

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…

cs.DB20156 cited

Combining Rewriting and Incremental Materialisation Maintenance for Datalog Programs with Equality

Boris Motik, Yavor Nenov, Robert Piro +1

Materialisation precomputes all consequences of a set of facts and a datalog program so that queries can be evaluated directly (i.e., independently from the program). Rewriting opt…

cs.AI2013

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…