Simplification Rules for Intuitionistic Propositional Tableaux

Authors:
Mauro Ferrari;Camillo Fiorentini;Guido Fiorino
Affiliations:
Università degli Studi dell’Insubria;Università degli Studi di Milano;Università degli Studi di Milano-Bicocca
Venue:
ACM Transactions on Computational Logic (TOCL)
Year:
2012

Citing 13
Cited 0

A Computing Procedure for Quantification Theory

Journal of the ACM (JACM)
A Machine-Oriented Logic Based on the Resolution Principle

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

Communications of the ACM
Reductions for non-clausal theorem proving

Theoretical Computer Science
Implementing the Davis–Putnam Method

Journal of Automated Reasoning
Simplification and Backjumping in Modal Tableau

TABLEAUX '98 Proceedings of the International Conference on Automated Reasoning with Analytic Tableaux and Related Methods
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
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
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
FCUBE: an efficient prover for intuitionistic propositional logic

LPAR'10 Proceedings of the 17th international conference on Logic for programming, artificial intelligence, and reasoning

Quantified Score

Hi-index	0.00

Visualization

Abstract

The implementation of a logic requires, besides the definition of a calculus and a decision procedure, the development of techniques to reduce the search space. In this article we introduce some simplification rules for Intuitionistic propositional logic that try to replace a formula with an equi-satisfiable “simpler” one with the aim to reduce the search space. Our results are proved via semantical techniques based on Kripke models. We also provide an empirical evaluation of their impact on implementations.