Extending Datalog with Sets Using an Encoding in Existential Rules
From International Center for Computational Logic
Extending Datalog with Sets Using an Encoding in Existential Rules
Thesis defence by Christian Lewe
- Location: APB 3027
- Start: 26. November 2018 at 1:00 pm
- End: 26. November 2018 at 2:30 pm
- Research group: Knowledge-Based Systems
- iCal
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.
