Abstract
The aim of this chapter is to show how the answer to a Datalog program can be computed. In order to achieve a computational approach to Datalog, in Sect. 7.1 we develop the proof theory of this language. We show how new facts can be inferred from an extensional database by use of a Datalog program. We then demonstrate that our proof-theoretic method is sound and complete, i.e., that it computes exactly what it should according to the model-theoretic semantics of Datalog. The proof theory of Datalog leads to a first algorithm “INFER” for processing Datalog programs. This algorithm iteratively computes new facts from facts that have already been established by using a forward chaining technique.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 1990 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Ceri, S., Gottlob, G., Tanca, L. (1990). Proof Theory and Evaluation Paradigms of Datalog. In: Logic Programming and Databases. Surveys in Computer Science. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-83952-8_7
Download citation
DOI: https://doi.org/10.1007/978-3-642-83952-8_7
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-83954-2
Online ISBN: 978-3-642-83952-8
eBook Packages: Springer Book Archive