Improvements to the Tableau Prover PITP

Authors:
Alessandro Avellone;Guido Fiorino;Ugo Moscato
Affiliations:
Dipartimento di Metodi Quantitativi per le Scienze Economiche e Aziendali, Università Milano-Bicocca, Piazza dell'Ateneo Nuovo, 1, 20126 Milano, Italy;Dipartimento di Metodi Quantitativi per le Scienze Economiche e Aziendali, Università Milano-Bicocca, Piazza dell'Ateneo Nuovo, 1, 20126 Milano, Italy;Dipartimento di Metodi Quantitativi per le Scienze Economiche e Aziendali, Università Milano-Bicocca, Piazza dell'Ateneo Nuovo, 1, 20126 Milano, Italy
Venue:
TABLEAUX '07 Proceedings of the 16th international conference on Automated Reasoning with Analytic Tableaux and Related Methods
Year:
2007

Citing 7
Cited 0

Implementing mathematics with the Nuprl proof development system

Implementing mathematics with the Nuprl proof development system
On intuitionistic proof transformations, their complexity, and application to constructive program synthesis

Fundamenta Informaticae - Special issue on symbolic computation and artificial intelligence
Timing Analysis of Combinational Circuits in Intuitionistic Propositional Logic

Formal Methods in System Design
Simplification: A General Constraint Propagation Technique for Propositional and Modal Tableaux

TABLEAUX '98 Proceedings of the International Conference on Automated Reasoning with Analytic Tableaux and Related Methods
STRIP: Structural Sharing for Efficient Proof-Search

IJCAR '01 Proceedings of the First International Joint Conference on Automated Reasoning
The ILTP Problem Library for Intuitionistic Logic

Journal of Automated Reasoning
ESBC: an application for computing stabilization bounds

Electronic Notes in Theoretical Computer Science (ENTCS)

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper we discuss the new version of PITP, a procedure to decide propositional intuitionistic logic, which turns out at the moment to be the best propositional prover on ILTP. The changes in the strategy and implementation make the new version of PITP faster and capable of deciding more formulas than the previous one. We give a short account both of the old optimizations and the changes in the strategy with respect to the previous version. We use ILTP library and random generated formulas to compare the implementation described in this paper to the other provers (including our old version of PITP).