Abstract
In this paper we extend work of Treitel and Genesereth for calculating cost estimates for alternative proof methods of logic programs. We consider four methods: (1) forward chaining by semi-naive bottom-up evaluation, (2) goal-directed forward chaining by semi-naive bottom-up evaluation after Generalized Magic-Sets rewriting, (3) backward chaining by OLD resolution, and (4) memoing backward chaining by OLDT resolution. The methods can interact during a proof. After motivating the advantages of each of the proof methods, we show how the effort for the proof can be estimated. The calculation is based on indirect domain knowledge like the number of initial facts and the number of possible values for variables. From this information we can estimate the probability that facts are derived multiple times. An important valuation factor for a proof strategy is whether these duplicates are eliminated. For systematic analysis we distinguish between in costs and out costs of a rule. The out costs correspond to the number of calls of a rule. In costs are the costs for proving the premises of a clause. Then we show how the selection of a proof method for one rule influences the effort of other rules. Finally we discuss problems of estimating costs for recursive rules and propose a solution for a restricted case.
Chapter PDF
Similar content being viewed by others
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
[Balbin et al., 1991] I. Balbin, G. S. Port, K. Ramamohanarao, and K. Meenakshi. Efficient bottom-up computation of queries on stratified databases. Journal of Logic Programming, 11:295–344, 1991.
Francois Bancilhon and Raghu Ramakrishnan. An amateur's introduction to recursive query processing strategies. In Proceedings of the ACM SIGMOD Conference, pages 16–52. ACM, 1986.
Francois Bancilhon and Raghu Ramakrishnan. Performance evaluation of data intensive logic programs. In Jack Minker, editor, Foundations of Deductive Databases and Logic Programming, pages 441–517. Morgan Kaufmann Publishers, Inc., Los Altos, CA, 1988.
[Bancilhon et al., 1986] F. Bancilhon, D. Maier, Y. Sagiv, and J. D. Ullman. Magic sets and other strange ways to implement logic programs. In Proceedings 5th ACM SIGMOD-SIGACT Symposium on Principles of Database Systems, pages 1–15. ACM, 1986.
F. Bancilhon. A note on the performance on rule-based systems. Technical Report DB-022-85, MCC, 1985.
Catriel Beeri and Raghu Ramakrishnan. On the power of magic. Journal of Logic Programming, 10:255–299, October 1991.
[Boley et al., 1993] Harold Boley, Philipp Hanschke, Knut Hinkelmann, and Manfred Meyer. COLAB: A hybrid knowledge compilation laboratory. Research Report RR-93-08, DFKI, Kaiserslautern, Germany, January 1993. Also to appear in Annals of Operations Research.
Francois Bry. Query evaluation in recursive databases: bottom-up and top-down reconciled. Data and Knowledge Engineering, 5:289–312, 1990.
S. W. Dietrich. Extension tables: Memo relations in logic programming. In SLP-87, 1987.
J. Komorowski. An introduction to partial deduction. In A. Pettorossi, editor, Meta-Programming in Logic, Uppsala, Sweden, June 1992 (Lecture Notes in Computer Science, vol. 649), pages 49–69. Berlin: Springer-Verlag, 1992.
Thomas Labisch. Developing a combined forward/backward-chaining system for logic programs in a hybrid expertsystem shell. Master's thesis, Universität Kaiserslautern, June 1993. In German.
Wolfgang Nejdl. Recursive strategies for answering recursive queries — the RQA/FQI strategy. In Proceedings of the 13th International Conference on Very Large Databases (VLDB), pages 43–50, Brighton, 1987.
Nils J Nilsson. Principles of Artificial Intelligence. Tioga, Palo Alto, CA, 1980.
Raghu Ramakrishnan. Magic templates: A spellbinding approach to logic programms. In R.A. Kowalski and K.B. Bowen, editors, Proceedings of the 5th International Conference and Symposium on Logic Programming, 1988.
[Rohmer et al., 1986] J. Rohmer, R. Lescoeur, and J. M. Kerisit. The alexander method — a technique for the processing of recursive axioms in deductive databases. New Generation Computing, pages 273–285, 1986.
D. Sacca and C. Zaniolo. The generalized counting method for recursive logic queries. In First International Conference on Database Theory, 1986.
Hisso Tamaki and Taisuke Sato. OLD resolution with tabulation. In E. Shapiro, editor, Third International Conference on Logic Programming (ICLP), LNCS 225, pages 505–512, London, July 1986. Springer Verlag.
Richard Treitel and Michael R. Genesereth. Choosing directions for rules. Journal of Automated Reasoning, 3:395–431, 1987.
Richard Treitel. Sequentialization of logic programs. Technical Report STAN-CS-86-1135, Stanford University, Department of Computer Science, November 1986.
Laurent Vieille. Recursive axioms in deductive databases: The query/subquery approach. In L. Kerschberg, editor, Proceedings of the First International Conference on Expert Database Systems, April 1986.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1994 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Hinkelmann, K., Hintze, H. (1994). Computing cost estimates for proof strategies. In: Dyckhoff, R. (eds) Extensions of Logic Programming. ELP 1993. Lecture Notes in Computer Science, vol 798. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-58025-5_54
Download citation
DOI: https://doi.org/10.1007/3-540-58025-5_54
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-58025-6
Online ISBN: 978-3-540-48417-2
eBook Packages: Springer Book Archive