Abstract
We present an Interpretation algorithm for pure logic programs, in the sense of a many-sorted Horn logic, which combines both model and proof theoretic evaluation of goals. While proof theoretic goal evaluation is the Standard deductive mechanism of proving a goal from a set of Horn clauses, the model theoretic aspect goes back to searching a model for a Solution of the given goal. Since modeis of logic programs tend to be infinite and we want to store our modeis in a relational database, we can consider only finite excerpts of modeis, called views in our discussion. The idea of the integrated truth checking algorithm is to solve a goal by first Consulting the database for a possible Solution and to initiate a deduction process in case no such immediate Solutions can be found. We prove that this evaluation strategy is correct but — in general — not complete.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Bibliography
J. A. Goguen, J. W. Thatcher, E. Wagner An Initial Algebra Approach to The Specification, Correctness and Implementation of Abstract Data Types. In: Current Trends in Programming Methodology, R. T. Yeh, (ed), Prentice-Hall, 1978.
K. R. Apt, M. H. van Emden Contributions to The Theory of Logic Programming. Journal of the ACM, Volume 29, Number 3, 1982.
R. Bayer Query Evaluation and Recursion in Deductive Database Systems. Technical Report TUM-I8503, Technische Universitaet Muenchen, 1985.
W. Bibel Automated Theorem Proving. Vieweg Verlag, Braunschweig 1982.
J. Bocca On The Evaluation Strategy of EDUCE. Proc. ACM-SIGMOD 86, C. Zaniolo (ed), Washingthon 1986.
S. Bayerl, E. Eder, F. Kurfess, R. Letz, J. Schumann An Implementation of a PROLOG-like Theorem Prover Based on The Connection Method. Proc. AIMSA 86, North-Holland 1986.
S. Ceri, G. Gottlob, G. Wiederhold Interfacing Relational Databases and Prolog Efficiently. Proc. 1st International Conference on Expert Database Systems, L. Kerschberg (ed), Charleston 1986.
W. F. Clocksin, C. S. Mellish Programming in Prolog. Springer Verlag, Berlin 1982.
C. J. Date Introduction to Database Systems. Addison Wesley Publishing Company, 1982.
P. Dadam et al. A DBMS Prototype to Support Extended NF2 Relations: An Integrated View of Flat Tables and Hierarchies. Proc. ACM-SIGMOD 86, C. Zaniolo (ed), Washingthon 1986.
H. Ehrig, B. Mahr Foundations of Algebraic Specification 1. Springer Verlag, Berlin 1985.
M. H. van Emden, R. A. Kowalski The Semantics of Predicate Logic as a Programming Language. Journal of the ACM, Volume 23, Number 4, 1976.
Guentzer, U. Kiessling, W., R. Bayer On the Evaluation of Recursion in (Deductive) Database Systems by Efficient Differential Fixpoint Iteration. Technical Report TUM-I8603, Technische Universitaet Muenchen, 1986.
A. Goguen, J. Meseguer EQLOG: Equality, Types and Generic Modules for Logic Programming. In: Functional and Logic Programming, De Groot and Lindstrom (eds), Prentice Hall, 1986.
M. Jarke, J. Clifford, Y.Vassiliou An Optimizing Prolog Front-End to a Relational Query System. Proc. ACM-SIGMOD 84, Boston 1984.
J. W. Lloyd Foundations of Logic Programming. Springer Verlag, Berlin 1984.
B. Mahr, J. A. Makowsky Characterizing Specification Languages which Admit Initial Semantics. Theoretical Computer Science, Volume 31, North-Holland 1984.
U. Pletat, C. Beierle The Semantics of Asserting and Retracting Clauses to Logic Programs. LILOG Report No. 7, IBM Deutschland GmbH, Stuttgart 1987.
P. Pistor, R. Traunmueller A Database Language for Sets, Lists, and Tables. IBM Heidelberg Scientific Center, Report No. TR 85.10.004, Heidelberg 1985.
R. Reiter Towards a Logical Reconstruction of Relational Database Theory. In: On Conceptual Modelling, M. L. Brodie, J. Myloppoulos and J. W. Schmidt (eds), Springer Verlag, New York 1984.
M. Schmidt-Schauss Unification in a Many-sorted Calculus with Declarations. Proc. 9th German Workshop on Artificial Intelligence, H. Stoyan (ed), Springer Verlag, Berlin 1985.
H.-J. Schek, M. H. Scholl The Relational Model with Relation-Valued Attributes. Information Systems, Vol. 11, No. 2, 1986.
S. Tsur, C. Zaniolo LDL: A Logic-Based Data-Language. Proc. 12th VLDB, Y. Kambayashi (ed), Kyoto 1986.
J. D. Ullman Implementation of Logical Query Languages for Databases. In: ACM Transactions on Database Systems, Volume 10, Number 3, 1985.
G. van Emde Boas, P. van Emde Boas. Storing and evaluating Horn-clause rules in a relational database. IBM Journal of Research and Development, Vol. 30, No. 1, 1986.
H. Waechter Storage Mechanisms for Connection Graphs in Nonstandard Database Systems. Pre-Master Thesis, University of Stuttgart, Stuttgart 1987, (in german)
C. Zaniolo The Representation and Deductive Retrieval of Complex Objects. Proc. llth VLDB, A. Pirotte, Y. Vassiliou (eds), Stockholm 1985.
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
Pletat, U. (1989). Integrating Model Theoretic and Proof Theoretic Interpretation of Logic Programs. In: Christaller, T. (eds) Künstliche Intelligenz. Informatik-Fachberichte, vol 202. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-83739-5_3
Download citation
DOI: https://doi.org/10.1007/978-3-642-83739-5_3
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-50884-7
Online ISBN: 978-3-642-83739-5
eBook Packages: Springer Book Archive