Operator Decomposability: A New Type of Problem Structure
暂无分享,去创建一个
This paper describes a structural property of problems that allows an efficient strategy for solving a large number of problem instances to be based on a small amount of knowledge. Specifically, the property of operator decomposability is shown to be a sufficient condition for the effective application of the Macro Problem Solver, a method that represents its knowledge of a problem by a small number of operator sequences. Roughly, operator decomposability exists in a problem to the extent that the effect of an operator on each component of a state can be expressed as a function of only a subset of the components, independent of the remaining state components.
[1] Richard E. Korf. A Program That Learns to Solve Rubik's Cube , 1982, AAAI.
[2] C. Sims. Computational methods in the study of permutation groups , 1970 .
[3] R. Korf. Learning to solve problems by searching for macro-operators , 1983 .