Declarative datalog debugging for mere mortals

Sven Köhler; Bertram Ludäscher; Yannis Smaragdakis

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

Declarative datalog debugging for mere mortals

Sven Köhler, Bertram Ludäscher, Yannis Smaragdakis

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

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.

Original language	English (US)
Title of host publication	Datalog in Academia and Industry - Second International Workshop, Datalog 2.0, Proceedings
Pages	111-122
Number of pages	12
DOIs	https://doi.org/10.1007/978-3-642-32925-8_12
State	Published - 2012
Externally published	Yes
Event	2nd International Workshop on Datalog in Academia and Industry, Datalog 2.0 - Vienna, Austria Duration: Sep 11 2012 → Sep 13 2012

Publication series

Name	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume	7494 LNCS
ISSN (Print)	0302-9743
ISSN (Electronic)	1611-3349

Other

Other	2nd International Workshop on Datalog in Academia and Industry, Datalog 2.0
Country/Territory	Austria
City	Vienna
Period	9/11/12 → 9/13/12

ASJC Scopus subject areas

Theoretical Computer Science
General Computer Science

Online availability

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

Library availability

Discover UIUC Full Text

Cite this

Köhler, S., Ludäscher, B., & Smaragdakis, Y. (2012). Declarative datalog debugging for mere mortals. In Datalog in Academia and Industry - Second International Workshop, Datalog 2.0, Proceedings (pp. 111-122). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 7494 LNCS). https://doi.org/10.1007/978-3-642-32925-8_12

Declarative datalog debugging for mere mortals. / Köhler, Sven; Ludäscher, Bertram; Smaragdakis, Yannis.
Datalog in Academia and Industry - Second International Workshop, Datalog 2.0, Proceedings. 2012. p. 111-122 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 7494 LNCS).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

Köhler, S, Ludäscher, B & Smaragdakis, Y 2012, Declarative datalog debugging for mere mortals. in Datalog in Academia and Industry - Second International Workshop, Datalog 2.0, Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 7494 LNCS, pp. 111-122, 2nd International Workshop on Datalog in Academia and Industry, Datalog 2.0, Vienna, Austria, 9/11/12. https://doi.org/10.1007/978-3-642-32925-8_12

Köhler S, Ludäscher B, Smaragdakis Y. Declarative datalog debugging for mere mortals. In Datalog in Academia and Industry - Second International Workshop, Datalog 2.0, Proceedings. 2012. p. 111-122. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). doi: 10.1007/978-3-642-32925-8_12

@inproceedings{ad12cbda4063484a9d0cfc10cb14d6c7,

title = "Declarative datalog debugging for mere mortals",

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.",

author = "Sven K{\"o}hler and Bertram Lud{\"a}scher and Yannis Smaragdakis",

year = "2012",

doi = "10.1007/978-3-642-32925-8_12",

language = "English (US)",

isbn = "9783642329241",

series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

pages = "111--122",

booktitle = "Datalog in Academia and Industry - Second International Workshop, Datalog 2.0, Proceedings",

note = "2nd International Workshop on Datalog in Academia and Industry, Datalog 2.0 ; Conference date: 11-09-2012 Through 13-09-2012",

}

TY - GEN

T1 - Declarative datalog debugging for mere mortals

AU - Köhler, Sven

AU - Ludäscher, Bertram

AU - Smaragdakis, Yannis

PY - 2012

Y1 - 2012

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=84867127994&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84867127994&partnerID=8YFLogxK

U2 - 10.1007/978-3-642-32925-8_12

DO - 10.1007/978-3-642-32925-8_12

M3 - Conference contribution

AN - SCOPUS:84867127994

SN - 9783642329241

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 111

EP - 122

BT - Datalog in Academia and Industry - Second International Workshop, Datalog 2.0, Proceedings

T2 - 2nd International Workshop on Datalog in Academia and Industry, Datalog 2.0

Y2 - 11 September 2012 through 13 September 2012

ER -

Declarative datalog debugging for mere mortals

Abstract

Publication series

Other

ASJC Scopus subject areas

Online availability

Library availability

Related links

Fingerprint

Cite this