Skip to Main content Skip to Navigation
Conference papers

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.
Document type :
Conference papers
Complete list of metadata
Contributor : Publications Loria <>
Submitted on : Tuesday, September 26, 2006 - 8:41:00 AM
Last modification on : Friday, February 26, 2021 - 3:28:08 PM


  • HAL Id : inria-00098989, version 1



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⟩



Record views