Proof Plans and Proof Nets in Linear Logic -Abstract - - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 1999

Proof Plans and Proof Nets in Linear Logic -Abstract -

Didier Galmiche

Résumé

After recalling more classical strategies used for automated proof search in fragments of linear logic, we aim to present the specific planning strategies that are based on principles for proof nets construction. They will be illustrated by examples in the commutative and non-commutative cases, the later emphasising the interest of this approach mainly in case of non-provability. Moreover such strategies can be seen as strategies for some connection methods.
Fichier non déposé

Dates et versions

inria-00098989 , version 1 (26-09-2006)

Identifiants

  • HAL Id : inria-00098989 , version 1

Citer

Didier Galmiche. Proof Plans and Proof Nets in Linear Logic -Abstract -. Floc'99 Workshop on Strategies in Automated Deduction, 1999, Trento, Italy, 2 p. ⟨inria-00098989⟩
51 Consultations
0 Téléchargements

Partager

Gmail Facebook X LinkedIn More