A Syntactic Approach to Planning

  • T. C. Henderson
  • E. Muehle
Conference paper
Part of the NATO ASI Series book series (volume 45)


Formal language theory concerns the study of two major issues:
  1. 1.

    Generative Grammars: a language is specified in terms of an alphabet vocabulary symbols, rewrite rules and a start symbol; i.e., a method for generating all strings in the language, and

  2. 2.

    Recognizers: a language is specified by giving an alphabet, states, memory and state transitions; i.e., a method for deciding for any given string whether or not it is in the language. Most of the syntactic pattern recognition work has exploited the recognition aspect of formal language theory. What we propose here is the use of generative grammars as a mechanism to help encode plans.



Graph Grammar Generative Grammar Shape Grammar Length Slot Syntactic Approach 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. Bunke, H. (1982) Attributed Programmed Graph Grammars and Their Application to Schematic Diagram Interpretation. IEEE Transactions on Pattern Analysis and Machine Intelligence PAMI-4(6):574–582, November.MATHCrossRefGoogle Scholar
  2. Davis, L. and T.C. Henderson. (1981) Hierarchical Constraint Processes for Shape Analysis. IEEE Transactions on Pattern Analysis and Machine Intelligence, PAMI-3(3):265–277, May.MATHCrossRefGoogle Scholar
  3. Fu, K.S. and B.K. Bhargava. (1973) Tree Systems for Syntactic Pattern Recognition. IEEE Transactions on Computers C-22:1087–1099, December.MathSciNetCrossRefGoogle Scholar
  4. Fu, K.S. (1974) Mathematics in Science and Engineering. Volume 112: Syntactic Methods in Pattern Recognition. Academic Press.Google Scholar
  5. Gonzalez, Rafael C. and Michael G. Thomason. (1978) Applied Mathematics and Computation. Volume 14: Syntactic Pattern Recognition. Addison-Wesley Pub. Co.Google Scholar
  6. Henderson, T. and L. Davis. (1981) Hierarchical Models and Analysis of Shape. Pattern Recognition 14(1-6): 197–206, May.MathSciNetCrossRefGoogle Scholar
  7. Henderson, T.C. and Ashok Samal. (1985) Shape Grammar Compilers. Pattern Recognition 19(4)279–288.CrossRefGoogle Scholar
  8. Lin, W.C. and K.S. Fu. (1984) A Syntactic Approach to 3 – D Object Representation. IEEE Transactions on Pattern Analysis and Machine Intelligence PAMI 6(3):351–364, May.MATHCrossRefGoogle Scholar
  9. Muehle, Eric. (1986) FROBS Manual. Technical Report PASS-note-86-11, U. of Utah.Google Scholar
  10. Nilsson, N. (1971) Problem Solving Methods in AI. McGraw-Hill.Google Scholar
  11. Rosenfeld, A. and D. Milgram. (1972) Web Automata and Web Grammars. In B. Melzer and D. Michie (editors), Machine Intelligence, pages 3307–324. Edinburgh U. Press, Edinburgh.Google Scholar
  12. Winston, P. (1984) Artificial Intelligence. Addison-Wesley, Reading, Mass.MATHGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1988

Authors and Affiliations

  • T. C. Henderson
    • 1
  • E. Muehle
    • 1
  1. 1.Dept. of Computer ScienceThe University of UtahSalt Lake CityUSA

Personalised recommendations