论文信息 - STRIP: Structural Sharing for Efficient Proof-Search

STRIP: Structural Sharing for Efficient Proof-Search

The STRIP system is a theorem prover for intuitionistic propositional logic with two main characteristics: it deals with the duplication of formulae during proof-search from a fine and explicit management of formulae (as resources) based on a structural sharing and it builds, for a given formula, either a proof or a countermodel.

Dominique Méry | Dominique Larchey-Wendling | Didier Galmiche

[1] Seif Haridi,et al. An Intuitionistic Predicate Logic Theorem Prover , 1989, J. Log. Comput..

[2] Jörg Hudelmaier,et al. An O(n log n)-Space Decision Procedure for Intuitionistic Propositional Logic , 1993, J. Log. Comput..

[3] Roy Dyckhoff,et al. Contraction-free sequent calculi for intuitionistic logic , 1992, Journal of Symbolic Logic.

[4] Dominique Larchey-Wendling,et al. Formulae-as-Resources Management for an Intuitionistic Theorem Prover , 1998 .

[5] Mauro Ferrari,et al. Duplication-Free Tableau Calculi and Related Cut-Free Sequent Calculi for the Interpolable Propositional Intermediate Logics , 1999, Log. J. IGPL.

[6] Roy Dyckho. Loop � free construction of counter � models for intuitionistic propositional logic , 1995 .

[7] Dominique Larchey-Wendling,et al. Structural Sharing and Efficient Proof-Search in Propositional Intuitionistic Logic , 1999, ASIAN.