Declarative Debugging for Datalog with Aggregation

Raimund DachseltRaimund Dachselt, Lukas GerlachLukas Gerlach, Philipp HanischPhilipp Hanisch, Alex IvlievAlex Ivliev, Markus KrötzschMarkus Krötzsch, Maximilian MarxMaximilian Marx, Julián MéndezJulián Méndez

Download

Raimund Dachselt, Lukas Gerlach, Philipp Hanisch, Alex Ivliev, Markus Krötzsch, Maximilian Marx, Julián Méndez
Declarative Debugging for Datalog with Aggregation
In Alexander Krause, João Felipe Pimentel, eds., Proceedings of the Workshops of the EDBT/ICDT 2026 Joint Conference (EDBT/ICDT-WS 2026), Tampere, Finland, March 24, 2026, CEUR Workshop Proceedings, to appear. CEUR-WS.org

Details
Bibtex

KurzfassungAbstract
We propose summary proof trees as a way for explaining derivations in Datalog programs with aggregation. These combine structurally
similar parts of proof trees into a single, easier to understand structure. We show how to query for such summaries, discuss the implementation in our rule engine Nemo, and empirically establish the feasibility of the method. We also briefly introduce a graphical
interface for editing these proof queries and visualising the results.
Projekt:Project: CPEC, CeTI, SECAI, ScaDS.AI
Forschungsgruppe:Research Group: Wissensbasierte SystemeKnowledge-Based Systems

@inproceedings{DGHIKMM2026,
  author    = {Raimund Dachselt and Lukas Gerlach and Philipp Hanisch and Alex
               Ivliev and Markus Kr{\"{o}}tzsch and Maximilian Marx and
               Juli{\'{a}}n M{\'{e}}ndez},
  title     = {Declarative Debugging for Datalog with Aggregation},
  editor    = {Alexander Krause and Jo{\~{a}}o Felipe Pimentel},
  booktitle = {Proceedings of the Workshops of the {EDBT/ICDT} 2026 Joint
               Conference (EDBT/ICDT-WS 2026), Tampere, Finland, March 24, 2026},
  series    = {CEUR Workshop Proceedings},
  publisher = {CEUR-WS.org},
  year      = {2026}
}