Abstract
Abstraction has been identified as a powerful means to reduce the complexity of planning problems. In this paper, a formal model and a method are described for learning abstract plans from concrete plans. In this model, the problem of plan abstraction is decomposed into finding a state abstraction mapping and a sequence abstraction mapping. The definition of an abstract planning world and a generic state abstraction theory allows a totally different terminology to be introduced for the description of the abstract plans. Thereby, not only generalizations but real abstractions can be established which require a shift in representation. With the described explanation-based learning procedure PABS, deductively justified abstractions are constructed which are tailored to the application domain described by the theory. The proposed abstraction methodology is applied to learn from machine-oriented programs. An abstract program can be acquired on a higher programming level which is characterized through the use of abstract data types instead of machine-oriented data representations.
Preview
Unable to display preview. Download preview PDF.
References
Anderson, J. S. and Farley, A. M. (1988). Plan abstraction based on operator generalization. In Proceedings of the 7th National Conference on Artificial Intelligence (pp. 100–104), Morgan Kaufmann, San Mateo.
Bergmann, R. and Schmalhofer, F. (1991). CECoS: A case experience combination system for knowledge acquisition for expert systems. Behavior Research Methods, Instruments and Computers, 23, 142–148.
Bergmann, R. (1992a). Knowledge acquisition by generating skeletal plans. In Schmalhofer, F., Strube, G., and Wetter, T. (Eds.). Contemporary Knowledge Engineering and Cognition (pp. 125–134). Heidelberg: Springer.
Bergmann, R. (1992b). Explanation-based learning for the automated reuse of programs. In Proceedings of the IEEE-Conference on Computer Systems and Software Engineering, COMPEURO92, pp. 109–110.
Bergmann, R. (1992c). Learning abstract plans to speed up hierarchical planning. In Proceedings of the ML'92-Workshop “Knowledge Compilation and Speedup Learning”, Aberdeen, Scotland.
Braverman, M. and Russell, S. (1988). Boundaries of operationality. Proceedings of the 5th International Conference on Machine Learning (pp. 221–234). Ann Arbor, MI: Morgan Kaufmann.
Fikes, R.E., Hart, P.E., and Nilsson, N.J. (1972). Learning and executing generalized robot plans. Artificial Intelligence, 3, 251–288.
Friedland, P.E. and Iwasaki, Y. (1985). The concept and implementation of skeletal plans. Journal of Automated Reasoning.
Giordana, A., Roverso, D., and Saitta, L. (1991). Abstracting background knowledge for concept learning. In Kodratoff, Y. (Ed.), Lecture Notes in Artificial Intelligence: Machine Learning-EWSL-91 (pp. 1–13). Berlin: Springer.
Jeffries, R. Turner, A.A., and Polson, P.G. (1988). The processes involved in designing software. In J.R. Anderson (Ed.) Cognitive Skills and their Acquisition (pp. 255–283). Hillsdale, NJ: Lawrence Erlbaum.
Knoblock, C.A. (1989). A theory of abstraction for hierarchical planning. In Proceedings of the Workshop on Change of Representation and Inductive Bias (pp. 81–104). Boston, MA: Kluwer.
Kolodner, J. L. (1987). Extending problem solver capabilities through case-based inference. Proceedings of the 4th International Workshop on Machine Learning (pp. 167–178). Irvine, CA: Morgan Kaufmann.
Korf, R.E. (1988). Optimal path-finding algorithms. In Kumar (Ed.), Search in Artificial Intelligence (pp. 223–267). New York: Springer.
Lifschitz, V. (1987). On the semantics of STRIPS. In Reasoning about Actions and Plans: Proceedings of the 1986 Workshop (pp. 1–9). Timberline, Oregon.
Michalski, R.S. and Kodratoff, Y. (1990). Research in machine learning: Recent progress, classification of methods, and future directions. In Kodratoff, Y. and Michalski, R.S. (Eds.), Machine learning: An Artificial Intelligence Approach (Vol. 3, pp. 3–30). San Mateo, CA: Morgan Kaufmann.
Minton, S., Carbonell, J.G., Knoblock, C.A., Kuokka, D.R., Etzioni, O., and Gil, Y. (1989). Explanation-based learning: A problem solving perspective. Artificial Intelligence, 40, 63–118.
Mitchell, T.M., Keller, R.M., and Kedar-Cabelli, S.T. (1986). Explanation-based generalization: A unifying view. Machine Learning, 1 (1), 47–80.
Mozetic, I. and Holzbaur, C. (1991). Extending explanation-based generalization by abstraction operators. In Kodratoff, Y. (Ed.), Lecture Notes in Artificial Intelligence: Machine Learning-EWSL-91 (pp. 282–297). Berlin: Springer.
Plaisted, D. (1981). Theorem proving with abstraction. Artificial Intelligence, 16, 47–108.
Sacerdoti, E.D. (1974). Planning in a hierarchy of abstraction spaces. Artificial Intelligence, 5, 115–135.
Schmalhofer, F., Bergmann, R., Kühn, O., and Schmidt, G. (1991). Using integrated knowledge acquisition to prepare sophisticated expert plans for their re-use in novel situations. In Christaller, T. (Ed.), GWAI-91: 15. Fachtagung für Künstliche Intelligenz, Informatik Fachberichte (pp. 62–71). Springer-Verlag.
Schmalhofer, F., Globig, C., and Thoben, J. (1992). The refitting of plans by a human expert. In Schmalhofer, F., Strube, G., and Wetter, T. (Eds.). Contemporary Knowledge Engineering and Cognition (pp. 122–131). Heidelberg: Springer.
Schmidt, G. (1992). Knowledge acquisition from text in a complex domain. In Proceedings of the Fifth International Conference on Industrial & Engineering Applications of Artificial Intelligence and Expert Systems, Paderborn, Germany (in press).
Spur, G. (1979). Produktionstechnik im Wandel. München: Carl Hanser Verlag.
Tenenberg, J. (1986). Planning with abstraction. In Proceedings of the 6th National Conference on Artificial Intelligence (pp. 76–80), Philadelphia, PA.
Tenenberg, J. (1987). Preserving consistency across abstraction mappings. In McDermott, J. (Ed.), Proceedings of the 10th International Conference on Artificial Intelligence (pp. 1011–1014). Los Altos, CA: Morgan Kaufmann.
Unruh, A. and Rosenbloom, P. S. (1989). Abstraction in problem solving and learning. In Proceedings of the International Joint Conference on Artificial Intelligence-89 (pp. 590–595). Detroit, MI: Morgan Kaufmann.
Wilkins, D. (1984). Domain-independent Planning: Representation and plan generation. Artificial Intelligence, 22, 269–301.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1993 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Bergmann, R. (1993). Learning plan abstractions. In: Jürgen Ohlbach, H. (eds) GWAI-92: Advances in Artificial Intelligence. Lecture Notes in Computer Science, vol 671. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0019004
Download citation
DOI: https://doi.org/10.1007/BFb0019004
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-56667-0
Online ISBN: 978-3-540-47626-9
eBook Packages: Springer Book Archive