Abstract
To learn, a learner needs to formulate plans, monitor the plan execution to detect violated expectations, and then diagnose and rectify errors which the dis-confirming data reveal. In this paper, five heuristic methods are presented for repairing flawed beliefs. These beliefs are considered as theories that predict effects of actions. Theories presuppose particular structural characteristics. When data disconfirm a theory, the heuristics proposed suggest specific ways to remedy the theory, including restricting the conditions for invoking the theory and weakening the theory’s predictions. The five methods accomplish retraction, exclusion, avoidance, assurance and inclusion of outcomes that disconfirm a theory’s predictions. Each proposed theory fix produces as a by-product new domain concepts that capture environmental characteristics of instrumental value to the learner. The techniques proposed here provide the first analytical methods for constructing new knowledge. They extend and make practical the ideas of proofs and refutations originally introduced by Lakatos.
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
Hayes-Roth, F. and McDermott, J., “An interference matching technique for inducing abstractions,” CACM, Vol. 21, pp. 401–410, 1978.
Hayes-Roth, F., Klahr, P. and Mostow, D. J. J., “Knowledge acquisition, knowledge programming, and knowledge refinement”, Technical Report R-2540-NSF, The Rand Corporation, May 1980.
Hayes-Roth, F., Klahr, P., and Mostow, D. J., “Advice-taking and knowledge refinement: an iterative view of skill acquisition,” Skill Acquisition and Development, J. A. Anderson ( Ed. ), Erlbaum, 1981.
Lakatos, I., Proofs and Refutations: The Logic of Mathematical Discovery, Cambridge University Press, 1976.
Lenat, D. B., “AM: An artificial intelligence approach to discovery in mathematics as heuristic search”, Technical Report SAIL AIM-286, AI Lab, Stanford University, 1976.
Mitchell, T. M., Version spaces: an approach to concept learning, Ph.D. dissertation, Stanford University, 1978.
Mostow, D. J., Mechanical transformation of task heuristics into operational procedures,Ph.D. dissertation, Carnegie-Mellon University, Dept. of Computer Science, April 1981, (Available as CMU-CS-81–113.).
Vere, S. A. A., “Induction of concepts in the predicate calculus,” Proceedings of the Fourth International Joint Conference on Artificial Intelligence, IJCAI, Tbilisi, USSR, 1975.
Vere, S. A., “Multilevel counterfactuals for generalizations of relational concepts and productions,” Artificial Intelligence, Vol. 14, pp. 139–164, 1980.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1983 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Hayes-Roth, F. (1983). Using Proofs and Refutations to Learn from Experience. In: Michalski, R.S., Carbonell, J.G., Mitchell, T.M. (eds) Machine Learning. Symbolic Computation. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-662-12405-5_8
Download citation
DOI: https://doi.org/10.1007/978-3-662-12405-5_8
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-662-12407-9
Online ISBN: 978-3-662-12405-5
eBook Packages: Springer Book Archive