Skip to main content
SpringerLink
Log in

Generating plans in linear logic

  • Logic
  • Conference paper
  • First Online:
Foundations of Software Technology and Theoretical Computer Science (FSTTCS 1990)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 472))

Abstract

We dealt with a well-delineated domain of planning and, thanks to linear logic, we gave it an adequate logical characterization, so that we managed to solve the completeness problem. Although this domain may appear restricting at first glance, it seems that it includes most of the examples in the literature on plan analysis and it gives rise to important questions which are quite satisfactorily handled by the formalism we proposed. On the other hand, we hope that our work modestly contributed to a deeper intuitive understanding of linear logic. Besides, we think that integrating other features of linear logic, such as the ones attached to linear implication (--o) or the bounded modalities ?n and !n will enable to cope with more realistic situations.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. W. Bibel: Matings in Matrices, Communications of the ACM Volume 26(1983) 844–852

    Google Scholar 

  2. W. Bibel: A Deductive Solution for Plan Generation, New Generation Computing4(1986) 115–132

    Google Scholar 

  3. W. Bibel, L. Farinas del Cerro, B. Fronhöfer, A. Herzig: Plan Generation by Linear Proofs: on semantics (draft, 13 pp.)

    Google Scholar 

  4. D. Chapman: Planning for conjunctive goals, Artificial Intelligence32(1987) 333–377

    Google Scholar 

  5. B. Fronhöfer: Linearity and Plan Generation, New Generation Computing5(1987) 213–225

    Google Scholar 

  6. M. Masseron, C. Tollu and J. Vauzeilles: Planification et logique linéaire, Technical report, Laboratoire d'Informatique de Paris-Nord,(1990)

    Google Scholar 

  7. G. Gentzen:The Collected Papers of Gerhard Gentzen, Ed. E. Szabo, North-Holland, Amsterdam (1969)

    Google Scholar 

  8. M.L. Ginsberg, D.E. Smith: Reasoning about Action I: A Possible Worlds Approach, Artificial Intelligence35(1988) 165–195

    Google Scholar 

  9. J.-Y. Girard:Proof theory and logical complexity, Bibliopolis, Napoli (1987)

    Google Scholar 

  10. J.-Y. Girard: Linear logic, Theoretical Computer Science50(1987) 1–102.

    Google Scholar 

  11. J.-Y. Girard: Towards a Geometry of Interaction, Proc. AMS Conference on Categories, Logic and Computer Science, Boulder, CO(1987)

    Google Scholar 

  12. J.-Y. Girard, Y. Lafont and P. Taylor:Proofs and Types, Cambridge Tracks in Computer Science, CUP (1989)

    Google Scholar 

  13. J. McCarthy, P.J. Hayes: Some Philosophical Problems from the Standpoint of Artificial Intelligence, Machine Intelligence4(1969) 463–502

    Google Scholar 

  14. N.J. Nilsson:Principles of Artificial Intelligence, Springer (1980)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. L.I.P.N./C.S.P. C.N.R.S. & Université Paris-Nord, 93430, Villetaneuse

    M. Masseron, C. Tollu & J. Vauzeilles

  2. Equipe de Logique, Université de Paris VII, C.N.R.S. UA 753, France

    M. Masseron

Authors
  1. M. Masseron
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. C. Tollu
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. J. Vauzeilles
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Kesav V. Nori C. E. Veni Madhavan

Rights and permissions

Reprints and permissions

Copyright information

© 1990 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Masseron, M., Tollu, C., Vauzeilles, J. (1990). Generating plans in linear logic. In: Nori, K.V., Veni Madhavan, C.E. (eds) Foundations of Software Technology and Theoretical Computer Science. FSTTCS 1990. Lecture Notes in Computer Science, vol 472. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-53487-3_35

Download citation

  • DOI: https://doi.org/10.1007/3-540-53487-3_35

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-53487-7

  • Online ISBN: 978-3-540-46313-9

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation