Abstract
The operational semantics of a logic program R is typically given as the set of answer substitutions which can be computed from an input statement G by pattern directed procedure calls of R. Unfortunately, the evaluation of programs is highly nondeterministic, it may lead to infinite computations and result in a lot of outputs. In this paper we restrict to data driven procedure calls and show that this has two main advantages:
-
(1)
the number of possible computations is strongly reduced, and
-
(2)
standard techniques allow to construct programs which can be proved to terminate finitely and uniquely. The restricted evaluation strategy is complete for a large class of programs.
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
K.R. Apt and M.H. van Emden, Contributions to the theory of logic programming, J.ACM 29 (1982), pp. 841–862.
K.L. Clark, Predicate logic as a computational formalism, Res. Rep., Dep. of Computing, Imperial College, London (1979).
K.L. Clark and F.G. Mc Cabe, The Control Facilities of IC-PROLOG Expert Systems in the Micro Electronic Age, (D. Michie Ed.), Edinburgh Univ. Press (1979), pp. 122–149.
N. Heck, Abstrakte Datentypen mit automatischen Implementierungen, Dissertation, Univ. Kaiserslautern (1984).
N. Heck and J. Avenhaus, Automatic Implementation of Abstract Data Types Specified by the Logic Programming Language, Proc. International Conf. on Fifth Generation Computer Systems, Tokyo (1984), pp. 210–219.
R. Hill, LUSH-Resolution and its completeness, DCL-Memo 78, Univ. Edinburgh (1974).
R. Kowalski, Predicate Logic as Programming Language, Proc. IFIP 74, North Holland, Amsterdam (1974), pp. 569–574.
D.E. Knuth and P.G. Bendix, Simple word problems in universal algebras. In: Computational Problems in Abstract Algebra (J. Leech, Ed.), Pergamon Press (1970), pp. 263–297.
J.W. Lloyd, Foundation of Logic Programming, Springer, Berlin (1984).
P.H. Morris, A Data-Flow Interpreter for Logic Programs, Logic Programming Workshop, Hungary (1980), pp. 148–159.
M.H. van Emden and R. Kowalski, The Semantics of Predicate Logic as a Programming Language, J.ACM 23 (1976), pp. 733–742.
M.J. Wise, A Parallel Prolog: the construction of a data-driven model, Conf. Rec. of the 1982 Symp. on LISP and Funct. Programming, pp. 56–66.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1985 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Heck, N., Avenhaus, J. (1985). On logic programs with data-driven computations. In: Caviness, B.F. (eds) EUROCAL '85. EUROCAL 1985. Lecture Notes in Computer Science, vol 204. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-15984-3_306
Download citation
DOI: https://doi.org/10.1007/3-540-15984-3_306
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-15984-1
Online ISBN: 978-3-540-39685-7
eBook Packages: Springer Book Archive