Declarative Datalog Debugging for Mere Mortals

  • Sven Köhler
  • Bertram Ludäscher
  • Yannis Smaragdakis
Conference paper

DOI: 10.1007/978-3-642-32925-8_12

Volume 7494 of the book series Lecture Notes in Computer Science (LNCS)
Cite this paper as:
Köhler S., Ludäscher B., Smaragdakis Y. (2012) Declarative Datalog Debugging for Mere Mortals. In: Barceló P., Pichler R. (eds) Datalog in Academia and Industry. Lecture Notes in Computer Science, vol 7494. Springer, Berlin, Heidelberg

Abstract

Tracing why a “faulty” fact A is in the model M = P(I) of program P on input I quickly gets tedious, even for small examples. We propose a simple method for debugging and “logically profiling” P by generating a provenance-enriched rewriting P̂, which records rule firings according to the logical semantics. The resulting provenance graph can be easily queried and analyzed using a set of predefined and ad-hoc queries. We have prototypically implemented our approach for two different Datalog engines (DLV and LogicBlox), demonstrating the simplicity, effectiveness, and system-independent nature of our method.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2012

Authors and Affiliations

  • Sven Köhler
    • 1
  • Bertram Ludäscher
    • 1
  • Yannis Smaragdakis
    • 2
    • 3
  1. 1.Department of Computer ScienceUniversity of CaliforniaDavisUSA
  2. 2.LogicBlox, Inc.AtlantaUSA
  3. 3.Univ. of AthensGreece