Foundations of Proof Search Strategies Design in Linear Logic - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 1994

Foundations of Proof Search Strategies Design in Linear Logic

Guy Perrier
  • Function : Author
  • PersonId : 8101
  • IdHAL : guy-perrier

Abstract

In this paper, we investigate automated proof construction in classical linear logic (CLL) by giving logical foundations for the design of proof search strategies. We propose common theoretical foundations for top-down, bottom-up and mixed proof search procedures with a systematic formalization of strategies construction using the notions of {\em immediate or chaining composition or decomposition}, deduced from permutability pro\-perties and inference movements in a proof. Thus, we have logical bases for the design of proof strategies in CLL fragments and then we can propose sketches for their design.
Fichier principal
Vignette du fichier
lfcs1994.pdf (9.91 Mo) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-01297758 , version 1 (04-04-2016)

Identifiers

  • HAL Id : hal-01297758 , version 1

Cite

Didier Galmiche, Guy Perrier. Foundations of Proof Search Strategies Design in Linear Logic. Logical Foundations of Computer Science, 1994, St-Petersburg, Russia. pp.101-113. ⟨hal-01297758⟩
121 View
41 Download

Share

Gmail Facebook X LinkedIn More