Abstract
It is shown that every pure logic program can be transformed to a normal form without changing the lengths of computations and the data flow during computation. The lengths of computations of logic programs in normal form are studied. Some sufficient conditions on the syntactic structure of programs are formulated that imply that the length of computation is linear with respect to the length of the input. On the other hand, it is shown that logic programs with the simplest possible normal forms, i.e. programs with at most one called node and one calling leaf, can simulate computations of arbitrary Turing machine. Consequently, such programs can exhibit arbitrary complex computational behaviour.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
A.K. Chandra and D. Harel, Horn Clause Queries and Generalizations J.Logic Programming 2 (1985), 1–15
Y.Moschovakis, Elementary Induction on Abstract Structures, Studies in Logic Vol. 77, North Holland, 1974
E.Y Shapiro Alternation and the Computational Complexity of Logic Programs, J. Logic Pragramming 1(1984), 19–33
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1989 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Ochozka, V., Štěpánková, O., Štěpánek, P., Hric, J. (1989). Normal forms and the complexity of computations of logic programs. In: Börger, E., Büning, H.K., Richter, M.M. (eds) CSL '88. CSL 1988. Lecture Notes in Computer Science, vol 385. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0026313
Download citation
DOI: https://doi.org/10.1007/BFb0026313
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-51659-0
Online ISBN: 978-3-540-46736-6
eBook Packages: Springer Book Archive