Abstract
In Ref. 3) a new linearity concept for proofs was introduced and its application to plan generation was proposed. An examination of these ideas revealed some troublespots which are discussed in this paper. Furthermore, three qualifications of the original linearity concept are presented which attempt to overcome these difficulties.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
Explore related subjects
Discover the latest articles, news and stories from top researchers in related subjects.References
Bibel, W., “Matings in Matrices,”CACM, 26 pp. 844–852, 1983.
Bibel, W.,Automated Theorem Proving, (second edition), Vieweg, 1986.
Bibel, W., “A Deductive Solution for Plan Generation,”New Generation Computing, Vol. 4, pp. 115–132, 1986.
Green, C., “Application of Theorem Proving to Problem Solving,”IJCAI-69, pp. 219–239.
Nilsson, N. J.,Principles of Artificial Intelligence, Springer, 1980.
Author information
Authors and Affiliations
About this article
Cite this article
Fronhöfer, B. Linearity and plan generation. New Gener Comput 5, 213–225 (1987). https://doi.org/10.1007/BF03037463
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF03037463