Optimization techniques for propositional intuitionistic logic and their implementation

Authors:
Alessandro Avellone;Guido Fiorino;Ugo Moscato
Affiliations:
Dipartimento di Metodi Quantitativi per le Scienze Economiche e Aziendali, Università di Milano-Bicocca, Piazza dellAteneo Nuovo, 1, 20126 Milano, Italy;Dipartimento di Metodi Quantitativi per le Scienze Economiche e Aziendali, Università di Milano-Bicocca, Piazza dellAteneo Nuovo, 1, 20126 Milano, Italy;Dipartimento di Metodi Quantitativi per le Scienze Economiche e Aziendali, Università di Milano-Bicocca, Piazza dellAteneo Nuovo, 1, 20126 Milano, Italy
Venue:
Theoretical Computer Science
Year:
2008

Citing 10
Cited 5

Implementing mathematics with the Nuprl proof development system

Implementing mathematics with the Nuprl proof development system
Abstract parametric classes and abstract data types defined by classical and constructive logical methods

Journal of Symbolic Computation
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
Decision Procedures for Intuitionistic Propositional Logic by Program Extraction

TABLEAUX '98 Proceedings of the International Conference on Automated Reasoning with Analytic Tableaux and Related Methods
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
Trees in Kripke Models and in an Intuitionistic Refutation System

CAAP '81 Proceedings of the 6th Colloquium on Trees in Algebra and Programming
Extracting Exact Time Bounds from Logical Proofs

LOPSTR '01 Selected papers from the 11th International Workshop on Logic Based Program Synthesis and Transformation
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)

Fast decision procedure for propositional Dummett logic based on a multiple premise tableau calculus

Information Sciences: an International Journal
FCUBE: an efficient prover for intuitionistic propositional logic

LPAR'10 Proceedings of the 17th international conference on Logic for programming, artificial intelligence, and reasoning
Simplification Rules for Intuitionistic Propositional Tableaux

ACM Transactions on Computational Logic (TOCL)
Refutation in dummett logic using a sign to express the truth at the next possible world

IJCAI'11 Proceedings of the Twenty-Second international joint conference on Artificial Intelligence - Volume Volume Two
BDD-based automated reasoning for propositional bi-intuitionistic tense logics

IJCAR'12 Proceedings of the 6th international joint conference on Automated Reasoning

Quantified Score

Hi-index	5.23

Visualization

Abstract

This paper presents some techniques which bound the proof search space in propositional intuitionistic logic. These techniques are justified by Kripke semantics and are the backbone of a tableau based theorem prover (PITP) implemented in C++. PITP and some known theorem provers are compared using the formulas of ILTP benchmark library. It turns out that PITP is, at the moment, the propositional prover that solves most formulas of the library.