Abstract
This chapter looks at some of the particular problems associated with the computational demands of AI. The frame problem is a serious pragmatic problem characteristic of AI and NL, in which we must consider tradeoffs in time and space efficiency relating to storage and recall of information. More generally, we consider the question of efficiency and just what can and cannot be achieved in a given time frame. This is contrasted with the intransigent problems for which no efficacious algorithm can guarantee a solution in any time frame. Heuristics may be used to trade a fast probable solution against the possibility of failure in both these cases.
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
Wexler, Kenneth, and Peter W. Culicover, Formal Principles of Language Acquisition (MIT Press, Cambridge, MA, 1980).
Gold, E. M., “Language Identification in the Limit”, Information and Control, Vol. 10 (1967), pp.447–474
Miller, George A., and Noam Chomsky, “Finitary Models of Language Users”, in R. A. Luce, R. R. Bush and E. Galanter, eds, Handbook of Mathematical Psychology, Vol. II (Wiley, New York, 1963), pp.419–491
Chomsky, Noam, “Formal Properties of Grammars”, in R. A. Luce, R. R. Bush and E. Galanter, Handbook of Mathematical Psychology, Vol. II (Wiley, New York, 1963), pp.269–321
Lamb, Sydney M., “On the Mechanization of Syntactic Analysis”, 1961 Conference on Machine Translation and Applied Language Analysis, Vol. II (1961), pp.674–685.
Gold, E. M., “Language Identification in the Limit”, Information and Control, Vol. 10 (1967), p.453.
Op. dt., p.453.
Anderson, John R., “Computer Simulation of a Language Acquisition System: A First Report”, in R. L. Solso, ed., Information Processing and Cognition: The Loyola Symposium (Lawrence Erlbaum Associates, Hillsdale, NJ, 1975), p.297–8.
Minsky, M., and S. Papert, Perceptrons (MIT Press, 1969), p.4.
Op. cit., p.16f.
Hayes, P J., “The Naive Physics Manifesto”, in D. Michie, ed., Expert Systems in the Micro-electronics Age (Edinburgh U.P., Edinburgh, Scotland, 1979), p.243f.
Powers, David M. W., L. Davila, and G. Wrightson, “Implementing Connection Graphs for Logic Programming”, Cybernetics and Systems ‘88 (Kluwer, 1988), pp .959–964.
Siklossy, Laurent, “A Language-Learning Heuristic Program”, Cognitive Psychology, Vol.2, Pt.1 (1971), p.480.
Fodor, Jerry, The Language of Thought (1975).
Kelley, K.L., Early Syntactic Acquisition (Rand Corporation, Santa Monica, CA, November 1967).
Kucera, Henry, “The Learning of Grammar”, Perspectives in Computing, Vol 1, No. 2 (1981), pp.28–35.
Kuczaj, Stan A., Crib Speech and Language Play (Springer-Verlag, New York, NY, 1983).
Sowa, J.F., Conceptual Stmctures: Information Processing in Mind and Machine (Addison Wesley, 1984).
Copeland, George, “What if Mass Storage Were Free”, IEEE Computer (July, 1982), pp.27–30.
Hayes, P J., “The Naive Physics Manifesto”, in D. Michie, ed., Expert Systems in the Micro-electronics Age (Edinburgh U.P., Edinburgh, Scotland, 1979), p.244f.
Loveland, Donald W., “Theorem-Provers Combining Model Elimination and Resolution”, Machine Intelligence, Vol. 4 (1969), pp.73–80
Loveland, Donald W., “A Unifying View of Some Linear Herbrand Procedures”, JACM, Vol. 19, No. 2 (April, 1972), pp.366–384.
Kowalski, Robert, “A Proof Procedure using Connection Graphs”, JACM, Vol. 22, No. 4 (October, 1975), pp.572–595.
Kowalski, Robert, Logic for Problem Solving (North Holland, New York and Oxford, 1979), p. 176.
Powers, David M. W., L. Davila, and G. Wrightson, “Implementing Connection Graphs for Logic Programming”, Cybernetics and Systems ‘88 (Kluwer, 1988), pp.959–964.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 1989 Springer-Verlag London Limited
About this chapter
Cite this chapter
Powers, D.M.W., Turk, C.C.R. (1989). Heuristics and Analytic Intransigence. In: Machine Learning of Natural Language. Springer, London. https://doi.org/10.1007/978-1-4471-1697-4_12
Download citation
DOI: https://doi.org/10.1007/978-1-4471-1697-4_12
Publisher Name: Springer, London
Print ISBN: 978-3-540-19557-3
Online ISBN: 978-1-4471-1697-4
eBook Packages: Springer Book Archive