An Existential Rule Framework for Computing Why-Provenance On-Demand for Datalog

Aus International Center for Computational Logic
Version vom 9. September 2022, 11:18 Uhr von Ali Elhalawati (Diskussion | Beiträge) (Die Seite wurde neu angelegt: „{{Publikation Erster Autor |ErsterAutorVorname=Ali |ErsterAutorNachname=Elhalawati |FurtherAuthors=Stephan Mennicke; Markus Krötzsch }} {{Inproceedings |Refer…“)
(Unterschied) ← Nächstältere Version | Aktuelle Version (Unterschied) | Nächstjüngere Version → (Unterschied)
Wechseln zu:Navigation, Suche

Toggle side column

An Existential Rule Framework for Computing Why-Provenance On-Demand for Datalog

Ali ElhalawatiAli Elhalawati,  Stephan MennickeStephan Mennicke,  Markus KrötzschMarkus Krötzsch
An Existential Rule Framework for Computing Why-Provenance On-Demand for Datalog


Ali Elhalawati, Stephan Mennicke, Markus Krötzsch
An Existential Rule Framework for Computing Why-Provenance On-Demand for Datalog
Proceddings of the 6th International Joint Conference on Rules and Reasoning (RuleML+RR 2022), to appear
  • KurzfassungAbstract
    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 entangle- ment 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 prove- nance 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.
  • Projekt:Project: CPECKIMEDSSECAIScaDS.AICfaed
  • Forschungsgruppe:Research Group: Wissensbasierte SystemeKnowledge-Based Systems
@inproceedings{EMK2022,
  author    = {Ali Elhalawati and Stephan Mennicke and Markus Kr{\"{o}}tzsch},
  title     = {An Existential Rule Framework for Computing Why-Provenance
               On-Demand for Datalog},
  booktitle = {Proceddings of the 6th International Joint Conference on Rules
               and Reasoning (RuleML+RR 2022)},
  year      = {2022},
  month     = {September}
}