Abstract
When searching a goal tree, an unbounded amount of work can be wasted solving the same problem over and over. Even worse, an unbounded amount of work can be wasted in an infinite recursion. The Standard technique of caching previous results can solve both problems. The cache is indexed by goal, normally implemented as a hash table. Each goal is associated with its current Solution status — either it is solved (in which case the answer is stored), it has failed, or it is still open. Whenever a goal is to be proved, the cache is searched first. If it is not there, a cache entry marked open should be created. If the cached goal has succeeded or failed just use the stored answer. In the special case of depth-first search <61>, infinite recursion occurs when an open cached goal is re-encountered; in this Situation, the goal should be treated as though it has failed, though it should not be recorded as such in the cache since an alternative path might still succeed. It also worthwhile canonicalizing the each entries so that similar goals can be recognised. Earleys algorithm <70> is an example of the use of caching.
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
Cohen, D. and Mostow, J. Automatic program speedup by deciding what to cache. In Proceedings of IJCAI-85, pages 165–172. International Joint Conference on Artificial Intelligence, 1985.
Gremban, K.D., Thorpe, C.E. and Kanade, T. Geometrie Camera Calibration using Systems of Linear Equations IEEE Int. Conf on Robotics and Automation, 1:562–567, 1988.
Woods, W.A. Cascaded ATN grammars. American Journal of Computational Linguistics, 6:1–12, 1980
Bruce, B. Case Systems for natural language. Artificial Intelligence, 6:327–360, 1975.
Danielsson, P.E. and Levialdi, S. Computer architectures for pictorial information systems. Computer, 14(11):53–67, November 1981.
Heckerman, D. Probabilistic interretations for MYCIN’s certainty factors. In L.N. Kanal and J.F. Lemmer, editors, Uncertainty in Artificial Intelligence. North Holland, Amsterdam and Oxford, 1986.
Thompson, H.S. and Ritchie, G.D. Techniques for parsing natural language: two examples. In Artificial Intelligence Skills, Harper and Row, 1983. Also available as Research Paper 183, Department of Artificial Intelligence, University of Edinburgh.
Kay, M. Algorithm Schemata and data structures in syntactic processing. In Text Processing: Text Analysis and Generation, Text Typology and Attribution, proceedings of the Nobel Symposium 51, pages 327–358. Almqvist and Wiksell, Stockholm, 1982. Also available as CSL-80-12, Xerox PARC, Palo Alto, CA.
McCarthy, J. Circumscription — a form of non-monotonic reasoning. Artificial Intelligence, 13:27–39, 1980.
Quinlan, J.R. Discovering rules by induction from large collections of examples. In D. Michie, editor, Expert Systems in the Microelectronic Age, pages 168–201. Edinburgh University Press, Edinburgh, 1979.
Chang, C. and Lee, R.C. Symbolic Logic and Mechanical Theorem Proving. Academic Press, New York, 1973.
Kowalski, R.A. Logic for problem solving. North-Holland, New York, 1979.
Chang, C.C. and Keisler, H.J. Model Theory. North-Holland, New York, 1973.
Schank R.C. (editor). Conceptual Information Processing. North-Holland, Amsterdam and Oxford, 1975.
Andrews, P.B. Theorem proving via general matings. JACM, 28(2):193–214, 1981.
Bibel, W. On matrices with connections. JACM, 28(4):633–645, 1981.
Bibel, W. Automated Theorem Proving. Vieweg, Braunschweig Wiesbaden, 1982 (revised 1987).
Wallen, L.A. Automated deduction in non-classical logics. MIT Press, Cambridge, Mass. and London, 1990.
Feldman, J. and Ballard, D. Computing with Connections. Technical Report 72, University of Rochester, Computer Science Dept., New York, 1981.
Stolfo, J.S. and Shaw, D.E. Dado: a tree-structured machine architecture architecture for production systems. In Proceedings of AAAI-82, pages 242–246, American Association of Artificial Intelligence, 1982.
Atwell, E. S. Constituent-likelihood grammar. In R. Garside, G. Sampson and G. Leech, editors, The Computational Analysis of English: a corpus-based approach, pages 57–65. Longman, London, 1987.
Dechter, R. Enhancement schemes for constraint processing: backjumping, learning, and cutset deeomposition. Artificial Intelligence, 43, February 1990.
Dechter, R. and Pearl, J. Tree clustering for constraint networks. Artificial Intelligence, 33:353–366, 1989.
Freuder, E.C. A sufficient condition for backtrack-bound search. JACM, 32(4):755–761, 1985.
Stefik, M.J. Planning with constraints (Molgen: part 1). Artificial Intelligence, 16:111–139, 1981.
Voelcker, H.B. and Requicha, A.A.G. Geometrie Modeling of Mechanical Parts and Processes. Computer, 10:48–57, December 1977.
Gazdar, G. Phrase structure grammar. In P. Jacobson and G.K. Pullum, editors, The Nature of Syntactic Representation, pages 131–186. Reidel, Dordrecht, 1981.
Barrow, H.G. and Tenenbaum, J.M. Interpreting line drawings as three-dimensional scenes. Artificial Intelligence, 17:75–116, 1981.
Marr, D. Analysis of occluding contour. Proc. Roy. Soc. Lond., B197:441–475, 1977.
Shapiro, E.Y. An algorithm that infers theories from facts. In Proceedings of IJCAI-81, pages 446–451. International Joint Conference on Artificial Intelligence, 1981.
Wilson, H.R. and Giese, S.C Threshold visibility of frequence gradient patterns. Vision Research, 17:1177–1190, 1977.
Frisby, J.P. Seeing: illusion, brain, and mind. Oxford University Press, Oxford, England, 1979.
Besl, P. and Jain, R. Intrinsic and Extrinsic Surface Characteristics. IEEE CS Conference on Computer Vision and Pattern Recognition, pages 226–233, 1985.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1990 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Bundy, A. (1990). C. In: Bundy, A. (eds) Catalogue of Artificial Intelligence Techniques. Symbolic Computation. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-97276-8_3
Download citation
DOI: https://doi.org/10.1007/978-3-642-97276-8_3
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-97278-2
Online ISBN: 978-3-642-97276-8
eBook Packages: Springer Book Archive