FCUBE: an efficient prover for intuitionistic propositional logic

Authors:
Mauro Ferrari;Camillo Fiorentini;Guido Fiorino
Affiliations:
DICOM, Univ. degli Studi dell'Insubria, Varese, Italy;DSI, Univ. degli Studi di Milano, Milano, Italy;DIMEQUANT, Univ. degli Studi di Milano-Bicocca, Milano, Italy
Venue:
LPAR'10 Proceedings of the 17th international conference on Logic for programming, artificial intelligence, and reasoning
Year:
2010

Citing 7
Cited 3

A Computing Procedure for Quantification Theory

Journal of the ACM (JACM)
A machine program for theorem-proving

Communications of the ACM
Simplification and Backjumping in Modal Tableau

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
The ILTP Problem Library for Intuitionistic Logic

Journal of Automated Reasoning
Optimization techniques for propositional intuitionistic logic and their implementation

Theoretical Computer Science
Imogen: Focusing the Polarized Inverse Method for Intuitionistic Propositional Logic

LPAR '08 Proceedings of the 15th International Conference on Logic for Programming, Artificial Intelligence, and Reasoning

Simplification Rules for Intuitionistic Propositional Tableaux

ACM Transactions on Computational Logic (TOCL)
Complete completion using types and weights

Proceedings of the 34th ACM SIGPLAN conference on Programming language design and implementation
An improved BDD method for intuitionistic propositional logic: BDDIntKt system description

CADE'13 Proceedings of the 24th international conference on Automated Deduction

Quantified Score

Hi-index	0.00

Visualization

Abstract

We present FCUBE, a theorem prover for Intuitionistic propositional logic based on a tableau calculus. The main novelty of FCUBE is that it implements several optimization techniques that allow to prune the search space acting on different aspects of proof-search. We tested the efficiency of our techniques by comparing FCUBE with other theorem provers. We found that our prover outperforms the other provers on several interesting families of formulas.