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. © 2012 Springer-Verlag.
Cite
CITATION STYLE
Köhler, S., Ludäscher, B., & Smaragdakis, Y. (2012). Declarative datalog debugging for mere mortals. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 7494 LNCS, pp. 111–122). https://doi.org/10.1007/978-3-642-32925-8_12
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
