Abstract
This paper gives a method to estimate the space and time complexity of Horn programs executed under the OLDT search strategy (also called Earley Deduction or memoing).
The author was sponsored by project NF 102/62-356 (’Structural and Semantic Parallels in Natural Languages and Programming Languages’), funded by the Netherlands Organization for the Advancement of Research (NWO).
This is a preview of subscription content, log in via an institution.
Preview
Unable to display preview. Download preview PDF.
References
Aarts, Erik: 1995, Investigations in Logic, Language and Computation, PhD thesis, Research Institute for Language and Speech, University of Utrecht.
Apt, K. R. and Pellegrini, A.: 1994, On the occur-check free Prolog programs, ACM Toplas 16(3), 687–726.
Debray, Saumya K. and Lin, Nai-Wei: n.d., Cost Analysis of Logic Programs, Available as ftp://cs.arizona.edu/people/debray/papers/cost_analysis.ps.
Lin, Nai-Wei: 1993, Automatic Complexity Analysis of Logic Programs, PhD thesis, Department of Computer Science, University of Arizona. Available as ftp://cs.arizona.edu/caslog/naiwei93.tar.Z.
van Noord, Gertjan: 1993, Reversibility in Natural Language Processing, PhD thesis, Utrecht University.
Pereira, F. and Warren, D.H.: 1983, Parsing as deduction, Proceedings of the 21 st Ann. Meeting of the ACL, MIT, Cambridge, Mass., pp. 137–144.
Pereira, Fernando: 1993, Review of “The Logic of Typed Feature Structures” (Bob Carpenter), Computational Linguistics 19(3), 544–552.
Pereira, Fernando C.N. and Shieber, Stuart M.: 1987, Prolog and Natural Language Analysis, Vol. 10 of CSLI Lecture Notes, Stanford.
Shapiro, Ehud Y.: 1984, Alternation and the Computational Complexity of Logic Programs, Journal of Logic Programming 1, 19–33.
Tamaki, H. and Sato, T.: 1986, OLDT resolution with tabulation, Proc. of 3 rd Int. Conf. on Logic Programming, Springer-Verlag, Berlin, pp. 84–98.
Vieille, L.: 1989, Recursive query processing: the power of logic, Theoretical Computer Science 69, 1–53.
Warren, David H.D.: 1975, Earley deduction, unpublished note.
Warren, David S.: 1992, Memoing for Logic Programs, Communications of the ACM 35(3), 94–111.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1996 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Aarts, E. (1996). Complexity of Horn programs. In: Proietti, M. (eds) Logic Program Synthesis and Transformation. LOPSTR 1995. Lecture Notes in Computer Science, vol 1048. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-60939-3_6
Download citation
DOI: https://doi.org/10.1007/3-540-60939-3_6
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-60939-1
Online ISBN: 978-3-540-49745-5
eBook Packages: Springer Book Archive