Abstract
In this paper we discuss a declarative approach to debugging for DATALOG, a logic programming language based on a bottom-up evaluation strategy. We focus on the DATALOG implementation provided by the ALPE programming environment. In ALPE, a DATALOG program is translated by the Logic Query Compiler — LQC — into a Prolog program whose top-down evaluation corresponds to the bottom-up evaluation of the source DATALOG program. It follows then that the computational models of the source and the compiled programs are completely different. This makes the use of a tracer practically pointless.
Conversely, the definition of a declarative debugger in this framework requires that an adeguate representation of the computation steps be stored in order to rebuild the evaluation tree and to allow a conversation with the user to occur at source program level. In this paper we show how to produce such information from the DATALOG program.
This work has been supported by ”Progetto Finalizzato Sistemi Informatici e Calcolo Parallelo” of CNR. undergrant n. 90.00757.69
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
Bancilhon, F., Ramakrishnan, R., ”An amateur's introduction to Recursive Query Processing Strategies”, ACM Proc. on Database Systems, 1986.
Beeri, C., Ramakrishnan, R., ”On the Power of Magic”, ACM Proc. on Database Systems, 1987.
Donato, C., Sicilia, M., ”The Logic Query Compiler of Alpe” CRAI (Cosenza), Italy, Internal Report.
J.W. Lloyd, ”Declarative Error Diagnosis”, New Generation Computing 5, 2 (1987), pp. 133–154.
Mostardi, T., ”An Introduction to the Advanced Logic Programming Environment”, Internal Tech. Report for the ALPE Project, CRAI (Cosenza), Italy.
L.M. Pereira, M. Calejo, ”A Framework for Prolog Debugging”, Procs. 5th Int. Conf. on Logic Programming, MIT Press, 1988.
F. Russo, M. Sancassani, ”Debugging Tools for the ALPE environment: A Feasibility Study”, Internal Tech. Report for the ALPE Project, V. Silvani 1, DS Logics s.r.l., Bologna, Italy.
Sacca', D., Zaniolo, C., ”The generalized counting method for recursive logic queries”, Proc. 1st International Conf. on Database Theory, Rome, 1986, to appear in TCS.
Sacca', D., Zaniolo, C., ”Magic Counting Methods”, Proc. ACM SIGMOD Conf. San Francisco, 1987.
Sacca', D., Zaniolo, C., “Implementation of Recursive Queries for a Data Language based on Pure Horn Logic”, Proc. Fourth Int. Conference on Logic Programming. Melbourne, Australia, 1987.
E.Y. Shapiro, ”Algorithmic Program Debugging”, MIT Press, 1982.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1992 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Russo, F., Sancassani, M. (1992). A declarative debugging environment for DATALOG. In: Voronkov, A. (eds) Logic Programming. Lecture Notes in Computer Science, vol 592. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-55460-2_32
Download citation
DOI: https://doi.org/10.1007/3-540-55460-2_32
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-55460-8
Online ISBN: 978-3-540-47083-0
eBook Packages: Springer Book Archive