Proof Plans and Proof Nets in Linear Logic -Abstract -
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.