Abstract
This paper presents some lower bounds for the lengths of refutations in logic programming. These lower bounds will immediately imply corresponding lower bounds for pure Prolog. For programs without free variables, we present the Special Linear Lower Bounds. For goals whose ground solutions would generate a discrete data-type, we present the Asymptotic log(n) Lower Bound.
This is a preview of subscription content, log in via an institution.
Preview
Unable to display preview. Download preview PDF.
References
Ko, H-P, and Nadel, M.E., Substitution and Refutation Revisited, Proceedings of the Eighth International Conference on Logic Programming, 1991.
Ko, H-P, and Nadel, M.E., Lower Bounds for the Lengths of Refutations, submitted for publication, 1991.
Lassez, J-L, Maher, M.J., and Marriott, K., Unification Revisited, in M. Boscarol, L. Carlucci Aiello, and G. Levi (eds), Foundations of Logic and Functional Programming, LNCS 306 (1987), pp. 67–113.
Lloyd, J.W., Foundations of Logic Programming, 2nd edition, Springer-Verlag, 1987.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1992 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Ko, HP., Nadel, M.E. (1992). Elementary lower bounds for the lengths of refutations. In: Voronkov, A. (eds) Logic Programming and Automated Reasoning. LPAR 1992. Lecture Notes in Computer Science, vol 624. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0013056
Download citation
DOI: https://doi.org/10.1007/BFb0013056
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-55727-2
Online ISBN: 978-3-540-47279-7
eBook Packages: Springer Book Archive