Extending Datalog with Sets Using an Encoding in Existential Rules

Aus International Center for Computational Logic
Wechseln zu:Navigation, Suche

Extending Datalog with Sets Using an Encoding in Existential Rules

Verteidigung Studienarbeit von Christian Lewe
We extend Datalog with sets, in order to facilitate modelling with this logic, and define the resulting, extended logic. To allow practical reasoning over this logic, we show a translation algorithm into first-order logic and prove its correctness. Furthermore, we show that this translation exhibits optimal runtimes during the restricted chase, compared to Datalog, which means that reasoning over the extended logic is practically viable. Lastly, we explore possible applications of this logic in practice.


This presentation and the subsequent question session constitute a defence for acquiring a Bachelor of Science degree in computer science.