Generating Plans in Linear Logic : I. Actions as proofs - Archive ouverte HAL Accéder directement au contenu
Article Dans Une Revue Theoretical Computer Science Année : 1993

Generating Plans in Linear Logic : I. Actions as proofs

Résumé

There is an increasing interest in the relation between logic and the changes involved in reasoning and, specifically, in plan generation. Up to now, several attemptsin this direction have been made, either by embedding actions in a classical framework or by using nonstandard formalisms. We think that these attempts, though promising, miss their objectives, for a lack of a suitable logic, and that the effort must be pursued. In this paper, we show how to obtain a strong and clean correspondence between proof and sequences of actions by using only Girard's linear logic, eliminating from the classical logic the structural rules which are not adapted to our purpose. A theorem is presented which expresses the new adequacy between proofs and actions.

Mots clés

Fichier non déposé

Dates et versions

hal-00003530 , version 1 (10-12-2004)

Identifiants

  • HAL Id : hal-00003530 , version 1

Citer

Jacqueline Vauzeilles, Marcel Masseron, Christophe Tollu. Generating Plans in Linear Logic : I. Actions as proofs. Theoretical Computer Science, 1993, B, vol. 113, pp.349-370. ⟨hal-00003530⟩
46 Consultations
0 Téléchargements

Partager

Gmail Facebook X LinkedIn More