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

Authors:
Guido Fiorino
Affiliations:
Dipartimento di Metodi Quantitativi per le Scienze Economiche ed Aziendali, Universití di Milano-Bicocca, Piazza dell'Ateneo Nuovo, 1, 20126 Milano, Italy
Venue:
Information Sciences: an International Journal
Year:
2010

Citing 10
Cited 1

An O(nlog n)-SPACE Decision Procedure for the Propositional Dummett Logic

Journal of Automated Reasoning
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
Analytic Calculi for Projective Logics

TABLEAUX '99 Proceedings of the International Conference on Automated Reasoning with Analytic Tableaux and Related Methods
A Tableau System for Gödel-Dummett Logic Based on a Hypersequent Calculus

TABLEAUX '00 Proceedings of the International Conference on Automated Reasoning with Analytic Tableaux and Related Methods
Combining Proof-Search and Counter-Model Construction for Deciding Gödel-Dummett Logic

CADE-18 Proceedings of the 18th International Conference on Automated Deduction
Graph-based Decision for Gödel-Dummett Logics

Journal of Automated Reasoning
The ILTP Problem Library for Intuitionistic Logic

Journal of Automated Reasoning
Is there a need for fuzzy logic?

Information Sciences: an International Journal
Optimization techniques for propositional intuitionistic logic and their implementation

Theoretical Computer Science
Quantitative logic

Information Sciences: an International Journal

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

Quantified Score

Hi-index	0.07

Visualization

Abstract

We present a procedure to decide propositional Dummett logic. Such a procedure relies on a tableau calculus with a multiple premise rule and optimizations. The resulting implementation outperforms the state of the art graph-based procedure.