Skip to main content
Log in

Linearity and plan generation

  • Regular Papers
  • Published:
New Generation Computing Aims and scope Submit manuscript

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.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Bibel, W., “Matings in Matrices,”CACM, 26 pp. 844–852, 1983.

    MATH  MathSciNet  Google Scholar 

  2. Bibel, W.,Automated Theorem Proving, (second edition), Vieweg, 1986.

  3. Bibel, W., “A Deductive Solution for Plan Generation,”New Generation Computing, Vol. 4, pp. 115–132, 1986.

    Article  MATH  Google Scholar 

  4. Green, C., “Application of Theorem Proving to Problem Solving,”IJCAI-69, pp. 219–239.

  5. Nilsson, N. J.,Principles of Artificial Intelligence, Springer, 1980.

Download references

Author information

Authors and Affiliations

Authors

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

Download citation

  • Received:

  • Revised:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF03037463

Keywords

Navigation