A Syntactic Approach to Planning
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
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.
Unable to display preview. Download preview PDF.
- Fu, K.S. (1974) Mathematics in Science and Engineering. Volume 112: Syntactic Methods in Pattern Recognition. Academic Press.Google Scholar
- Gonzalez, Rafael C. and Michael G. Thomason. (1978) Applied Mathematics and Computation. Volume 14: Syntactic Pattern Recognition. Addison-Wesley Pub. Co.Google Scholar
- Muehle, Eric. (1986) FROBS Manual. Technical Report PASS-note-86-11, U. of Utah.Google Scholar
- Nilsson, N. (1971) Problem Solving Methods in AI. McGraw-Hill.Google Scholar
- 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