Declarative Debugging for Datalog with Aggregation
From International Center for Computational Logic
Declarative Debugging for Datalog with Aggregation
Talk by Philipp Hanisch
- Location: APB-2026
- Start: 19. March 2026 at 11:00 am
- End: 19. March 2026 at 12:00 pm
- Research group: Knowledge-Based Systems
- Event series: Research Seminar Logic and AI
- iCal
This talk will 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. It will show how to query for such summaries, discuss the implementation in the rule engine Nemo, and empirically establish the feasibility of the method. It will also briefly introduce a graphical interface for editing these proof queries and visualising the results.
