An Existential Rule Framework for Computing Why-Provenance On-Demand for Datalog
Vortrag von Ali Elhalawati
Why-provenance — explaining why a query result is obtained — is an essential asset for reaching the goal of Explainable AI. For instance, recursive (Datalog) queries may show unexpected derivations due to complex entanglement of database atoms inside recursive rule applications. Provenance, and why-provenance in particular, helps debugging rule sets to eventually obtain the desired set of rules. There are three kinds of approaches to computing why-provenance for Datalog in the literature: (1) the complete ones, (2) the approximate ones, and (3) the theoretical ones. What all these approaches have in common is that they aim at computing provenance for all IDB atoms, while only a few atoms might be requested to be explained. We contribute an on-demand approach: After deriving all entailed facts of a Datalog program, we allow for querying for the provenance of particular IDB atoms and the structures involved in deriving provenance are computed only then. Our framework is based on terminating existential rules, recording the different rule applications. We present two implementations of the framework, one based on the semiring solver FPsolve, the other one based Datalog(S), a recent extension of Datalog by set terms. We perform experiments on benchmark rule sets using both implementations and discuss feasibility of provenance on-demand.
The talk is based on the upcoming conference paper in RuleML+RR 2022 with Markus Krötzsch and Stephan Mennicke, the paper can be found through the following link: https://iccl.inf.tu-dresden.de/web/Inproceedings3342
The talk will take place in a hybrid fashion, physically in the seminar room, and online through the link: