11 citations · 25 across the 8 of their papers we have counts for
8 papers
Optimised Storage for Datalog Reasoning
Xinyue Zhang, Pan Hu, Yavor Nenov +1
Materialisation facilitates Datalog reasoning by precomputing all consequences of the facts and the rules so that queries can be directly answered over the materialised facts. Howe…
Enhancing Datalog Reasoning with Hypertree Decompositions
Xinyue Zhang, Pan Hu, Yavor Nenov +1
Datalog reasoning based on the seminaïve evaluation strategy evaluates rules using traditional join plans, which often leads to redundancy and inefficiency in practice, especially…
Data Science with Vadalog: Bridging Machine Learning and Reasoning
Luigi Bellomarini, Ruslan R. Fayzrakhmanov, Georg Gottlob +7
Following the recent successful examples of large technology companies, many modern enterprises seek to build knowledge graphs to provide a unified view of corporate knowledge and…
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…
Handling owl:sameAs via Rewriting
Boris Motik, Yavor Nenov, Robert Piro +1
Rewriting is widely used to optimise owl:sameAs reasoning in materialisation based OWL 2 RL systems. We investigate issues related to both the correctness and efficiency of rewriti…
Datalog Rewritability of Disjunctive Datalog Programs and its Applications to Ontology Reasoning
Mark Kaminski, Yavor Nenov, Bernardo Cuenca Grau
We study the problem of rewriting a disjunctive datalog program into plain datalog. We show that a disjunctive program is rewritable if and only if it is equivalent to a linear dis…
Topological Logics with Connectedness over Euclidean Spaces
Roman Kontchakov, Yavor Nenov, Ian Pratt-Hartmann +1
We consider the quantifier-free languages, Bc and Bc0, obtained by augmenting the signature of Boolean algebras with a unary predicate representing, respectively, the property of b…
On the Decidability of Connectedness Constraints in 2D and 3D Euclidean Spaces
Roman Kontchakov, Yavor Nenov, Ian Pratt-Hartmann +1
We investigate (quantifier-free) spatial constraint languages with equality, contact and connectedness predicates as well as Boolean operations on regions, interpreted over low-dim…