Proof Plans and Proof Nets in Linear Logic -Abstract -

Didier Galmiche 1
1 TYPES - Logic, proof Theory and Programming
LORIA - Laboratoire Lorrain de Recherche en Informatique et ses Applications
Abstract : 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.
Type de document :
Communication dans un congrès
Floc'99 Workshop on Strategies in Automated Deduction, 1999, Trento, Italy, 2 p, 1999
Liste complète des métadonnées

https://hal.inria.fr/inria-00098989
Contributeur : Publications Loria <>
Soumis le : mardi 26 septembre 2006 - 08:41:00
Dernière modification le : mardi 24 avril 2018 - 13:34:56

Identifiants

  • HAL Id : inria-00098989, version 1

Collections

Citation

Didier Galmiche. Proof Plans and Proof Nets in Linear Logic -Abstract -. Floc'99 Workshop on Strategies in Automated Deduction, 1999, Trento, Italy, 2 p, 1999. 〈inria-00098989〉

Partager

Métriques

Consultations de la notice

70