The Vadalog System: Datalog-based Reasoning for Knowledge Graphs

@article{Bellomarini2018TheVS,
  title={The Vadalog System: Datalog-based Reasoning for Knowledge Graphs},
  author={Luigi Bellomarini and Emanuel Sallinger and Georg Gottlob},
  journal={ArXiv},
  year={2018},
  volume={abs/1807.08709}
}
Over the past years, there has been a resurgence of Datalog-based systems in the database community as well as in industry. In this context, it has been recognized that to handle the complex knowledge-based scenarios encountered today, such as reasoning over large knowledge graphs, Datalog has to be extended with features such as existential quantification. Yet, Datalog-based reasoning in the presence of existential quantification is in general undecidable. Many efforts have been made to define… 

Figures from this paper

Datalog-based Reasoning for Knowledge Graphs

The Vadalog system, a Datalog-based system for performing complex logic reasoning tasks, such as those required in advanced knowledge graphs, is introduced; it is Oxford’s contribution to the VADA research programme and is a joint effort of the universities of Oxford, Manchester and Edinburgh and around 20 industrial partners.

An Overview of Vadalog: a System for Reasoning over Large Knowledge Graphs

Vadalog is described from an architectural point of view, focusing on the execution model, graph traversal strategies, and join algorithms, and an experimental evaluation of the system is provided.

Foundations of Knowledge Graphs: Complexity of Arithmetic in Vadalog

This work investigates potential candidates for arithmetic in Vadalog and shows that extending KG reasoning languages with arithmetic is a non-trivial problem, and proves P -completeness of the language, which is called Warded Bound Datalog Z, a decidable language supporting arithmetic.

Reasoning in Financial Settings with Harmful Joins

This work provides an algorithm to remove “harmful” joins on variables affected by existential quantification, supporting reasoning decidability and the full expressive power of the language while preserving the correctness of the task.

MeTeoR: Practical Reasoning in Datalog with Metric Temporal Operators

A novel approach for practical reasoning in DatalogMTL which combines materialisation (a.k.a. forward chaining) with automata-based techniques is presented which enables reasoning over complex temporal rules and datasets involving tens of millions of temporal facts.

Reasoning in Warded Datalog+/- with Harmful Joins

Warded Datalog+/- is a powerful member of the Datalog+/- family of logic languages, featuring full support for recursion and existential quantification. As a result of the promising trade-off between

The Space-Efficient Core of Vadalog

It is shown that piece-wise linear recursion alone, without the wardedness condition, is not enough as it leads to the undecidability of reasoning, and the relative expressiveness of the query languages based on (piece-wiselinear) warded sets of TGDs is studied.

The Space-Efficient Core of Vadalog

It is shown that piece-wise linear recursion alone, without the wardedness condition, is not enough as it leads to undecidability, and the relative expressiveness of the query languages based on warded sets of TGDs is studied.

iWarded: A System for Benchmarking Datalog+/- Reasoning (technical report)

The iWarded system is introduced, a system that can generate very large, complex, realistic reasoning settings to be used for the benchmarking of logic-based reasoning systems adopting Datalog+/-, a family of extensions of Datalogs that has seen a resurgence in the last few years.
...

References

SHOWING 1-10 OF 55 REFERENCES

Swift Logic for Big Data and Knowledge Graphs - Overview of Requirements, Language, and System

The vadalog system is introduced, which exploits the theoretical underpinning of relevant Datalog languages and combines it with existing and novel techniques from database and AI practice, and puts these swift logics into action.

A general datalog-based framework for tractable query answering over ontologies

It is shown in particular that Datalog+/- generalizes the DL-Lite family of tractable description logics, which are the most common tractable ontology languages in the context of the Semantic Web and databases.

The DLV system for knowledge representation and reasoning

The experimental results confirm the solidity of DLV and highlight its potential for emerging application areas like knowledge management and information integration, and the main international projects investigating the potential of the system for industrial exploitation are described.

Towards more expressive ontology languages: The query answering problem

Datalog+/-: A Family of Logical Knowledge Representation and Query Languages for New Applications

This paper discusses three paradigms ensuring decidability: chase termination, guardedness, and stickiness, and extends plain Datalog by features such as existentially quantified rule heads and restricts the rule syntax so as to achieveDecidability and tractability.

Combined Complexity of Repair Checking and Consistent Query Answering

The goal of the work is a thorough analysis of the complexity of the RC and CQA problems for a wide range of integrity constraints, which allows a better understanding of the true sources of complexity.

Functional Dependencies Unleashed for Scalable Data Exchange

A novel chase-based algorithm that can efficiently handle arbitrary fds on the target based on exploiting the interactions between source-to-target tuple-generating dependencies (tgds) and target fds is presented.

That's All Folks! LLUNATIC Goes Open Source

This work presents the Llunatic mapping and cleaning system, the first comprehensive proposal to handle schema mappings and data repairing in a uniform way, and incorporates unique features into the system, such as configurable user interaction and a tunable trade-off between efficiency and quality of the solutions.

Optimizing recursive queries with monotonic aggregates in DeALS

This paper describes how DeALS extends their definitions and modifies their syntax to enable a concise expression of applications that, without them, could not be expressed in performance-conducive ways, or could not been expressed at all, and introduces novel implementation and optimization techniques that outperform traditional approaches, including Semi-naive evaluation.
...