Abstract
During the 1980s we have seen the rise of an exciting new discipline of computed science, called logic programming. The most prominent representative of this new programming paradigm is the language PROLOG, developed in the early 1970s by Colmerauer in Marseille and Kowalski in Edinburgh. Programming in PROLOG differs from conventional programming both stylistically as well as computationally, as it uses logic to represent knowledge and deduction to solve problems. Due to the success of PROLOG in the academic world, logic programming today slowly begins to find its way out of the research labs into advanced products and systems like expert system shells or knowledge-based systems.
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.
References
F. Bancilhon, D. Maier, Y. Sagiv, and J. Ullman: “Magic Sets and other strange ways to implement logic programs”, Proc. 5th ACM Symp. on Principles of Database Systems, 1986, pp. 1–15
J. Bocca, M. Dahmen, M. Freeston, G. Macartney, and P. Pearson: “KB-Prolog: A Prolog for Very Large Knowledge Bases”, Proc. 7th British National Conf. on Databases, 1989, pp. 163–184
C. Beeri and R. Ramakrishnan: “On the power of magic”, Proc. 6th ACM Symp. on Principles of Database Systems, 1987, pp. 269–283
F. Bry: “Query Evaluation in Recursive Databases: Bottom-up and Top- Down Reconciled”, ECRC Internal Report IR-KB-64, Apr. 1989 (submitted for publication)
H. Gallaire and J. Minker (eds.): “Logic and Data Bases”, Plenum Press, New York - London, 1978
H. Gallaire, J. Minker, and J.M. Nicolas (eds.): Advances in Data Base Theory, Vol. 1, Plenum Press, New York - London, 1981
H. Gallaire, J. Minker, and J.M Nicolas (eds.): Advances in Data Base Theory, Vol. 2, Plenum Press, New York - London, 1984
H. Gallaire, J. Minker, and J.M. Nicolas: “Logic and databases: A deductive approach”, ACM Computing Surveys 16 (2), 1984, pp. 153–185
J. Rohmer, R. Lescoeur, and J.M. Kerisit: “The Alexander method, a technique for the processing of recursive axioms in a deductive database”, New Generation Computing 4 (3), 1986, pp. 273–285
H. Seki: “On the Power of Alexander Templates”, Proc. 8th ACM Symp. on Principles of Database Systems, 1989, pp. 150–159
H. Tamaki and T. Sato: “OLD resolution with tabulation”, Proc. 3rd Intern. Conf. on Logic Programming, 1986, pp. 84–98
M. van Emden and R. Kowalski: “The Semantics of Predicate Logic as a Programming Language”, Journal of the ACM 23 (4), 1976, pp. 733–742
L. Vieille: “A database-complete proof procedure based on SLD-resolution”, Proc. 4th Intern. Conf. on Logic Programming, 1987, pp. 74–103
L. Vieille: “Recursive Query Processing: The Power of Logic”, to appear in: Theoretical Computer Science 68 (2), Sept. 1989
L. Vieille and A. Lefebvre: “Deductive database systems and the Dedgin* query evaluator”, Proc. 7th British National Conf. on Databases, 1989
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1989 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Manthey, R., Gallaire, H., Nicolas, JM. (1989). Can we reach a uniform paradigm for deductive query evaluation?. In: Brauer, W., Freksa, C. (eds) Wissensbasierte Systeme. Informatik-Fachberichte, vol 227. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-75182-0_3
Download citation
DOI: https://doi.org/10.1007/978-3-642-75182-0_3
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-51838-9
Online ISBN: 978-3-642-75182-0
eBook Packages: Springer Book Archive