Abstract
It is widely accepted that many algorithms can be concisely and clearly expressed as logical inference rules. However, logic programming has been inappropriate for the study of the running time of algorithms because there has not been a clear and precise model of the run time of a logic program. We present a logic programming model of computation appropriate for the study of the run time of a wide variety of algorithms.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Weidong Chen and David S. Warren. Tabled evaluation with delaying for general logic programs. Journal of the ACM, 43(1):20–74, 1996.
H. Ganzinger and D. McAllester. A new meta-complexity theorem for bottom-up logic programs. In Proc. International Joint Conference on Automated Reasoning, volume 2083 of Lecture Notes in Computer Science, pages 514–528. Springer-Verlag, 2001.
Michael Gelfond and Vladimir Lifschitz. The stable model semantics for logic programming. In Robert A. Kowalski and Kenneth Bowen, editors, Proceedings of the Fifth International Conference on Logic Programming, pages 1070–1080, Cambridge, Massachusetts, 1988. The MIT Press.
Kolaitis. The expressive power of stratified logic programs. INFCTRL: Information and Computation (formerly Information and Control), 90, 1991.
David McAllester. The complexity analysis of static analyses. In Symposium on Static Analysis. Springer Verlag, 1999.
Jeff Naughton and Raghu Ramakrishnan. Bottom-up evaluation of logic programs. In Jean-Louis Lassez and Gordon Plotkin, editors, Computational Logic. MIT Press, 1991.
Jeff Polakow. Ordered linear logic and applications, 2001. Ph.D. Dissertation, Carnegie Mellon University.
T. Przymusinski. the declarative semantics of stratified deductive databases and logic programs, 1988.
K. Sagonas, T. Swift, and D. S. Warren. Xsb as an efficient deductive database engine. In Proc. of the 1994 ACM SIGMOD Int. Conf. on Management of Data (SIGMOD’94), 1994.
H. Tamaki and T. Sato. Old resolution with tabulation. In Proceedings of the Third International Conference on Logic Programming, 1986.
J. Ullman. Bottom-up beats top-down for datalog. In Proceedings of the Eigth ACM SIGACT-SIGMOD-SIGART Symposium on the Principles of Database Systems, pages 140–149, March 1989.
Jeffrey Ullman and Raghu Ramakrishnan. A survey of research in deductive database systems. J. Logic Programming, pages 125–149, May 1995.
M. Vardi. Complexity of relational query languages. In 14th Symposium on Theory of Computation, pages 137–146, 1982.
Yan Zhang and Norman Y. Foo. Towards generalized rule-based updates. In IJCAI-97, 1997.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2002 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Ganzinger, H., McAllester, D. (2002). Logical Algorithms. In: Stuckey, P.J. (eds) Logic Programming. ICLP 2002. Lecture Notes in Computer Science, vol 2401. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45619-8_15
Download citation
DOI: https://doi.org/10.1007/3-540-45619-8_15
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-43930-1
Online ISBN: 978-3-540-45619-3
eBook Packages: Springer Book Archive