Structural Sharing and Efficient Proof-Search in Propositional Intuitionistic Logic - Inria - Institut national de recherche en sciences et technologies du numérique Accéder directement au contenu
Communication Dans Un Congrès Année : 1999

Structural Sharing and Efficient Proof-Search in Propositional Intuitionistic Logic

Didier Galmiche

Résumé

In this paper, we present a new system for proof-search in propositional intuitionistic logic from which an efficient implementation based on structural sharing is naturally derived. The way to solve the problem of formula duplication is not based on logical solutions but on an appropriate representation of sequents with a direct impact on sharing and therefore on the implementation. Then, the proof-search is based on a finer control of the resources and has a ${\cal O}(n\log n)$-space complexity. The system has the subformula property and leads to an algorithm that, for a given sequent, constructs a proof or generates a counter-model.
Fichier non déposé

Dates et versions

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

Identifiants

  • HAL Id : inria-00098992 , version 1

Citer

Didier Galmiche, Dominique Larchey-Wendling. Structural Sharing and Efficient Proof-Search in Propositional Intuitionistic Logic. Asian Computing Science Conference - ASIAN'99, 1999, Phuket, Thailand, pp.101-112. ⟨inria-00098992⟩
50 Consultations
0 Téléchargements

Partager

Gmail Facebook X LinkedIn More