Abstract
Starting with only the legal conditions on a set of operators, a strategy learning system can employ weak methods to search a problem space. Once a solution path has been found, it can be used to assign credit and blame to instances of these operators. If a move leads from a state on the solution path to another state on the solution path, it is labelled as a positive instance of the responsible operator. However, if a move leads from a state on the solution path to a state not on the path, it is marked as a negative instance. These classifications can then be input to a condition-finding mechanism (such as the generalization, discrimination or version space <256> methods); which will determine the heuristically useful conditions under which each operator should be applied.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Similar content being viewed by others
Reference
Sleeman, D., Langley. P. and Mitchell, T. M. Learning from solution paths: An approach to the credit assignment problem. Al Magazine. 1982.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1984 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Bundy, A., Wallen, L. (1984). Learning from Solution Paths. In: Bundy, A., Wallen, L. (eds) Catalogue of Artificial Intelligence Tools. Symbolic Computation. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-96868-6_118
Download citation
DOI: https://doi.org/10.1007/978-3-642-96868-6_118
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-13938-6
Online ISBN: 978-3-642-96868-6
eBook Packages: Springer Book Archive