BDD-based automated reasoning for propositional bi-intuitionistic tense logics

Authors:
Rajeev Goré;Jimmy Thomson
Affiliations:
Logic and Computation Group, Research School of Computer Science, The Australian National University, Australia;Logic and Computation Group, Research School of Computer Science, The Australian National University, Australia
Venue:
IJCAR'12 Proceedings of the 6th international joint conference on Automated Reasoning
Year:
2012

Citing 9
Cited 1

The description logic handbook: theory, implementation, and applications

The description logic handbook: theory, implementation, and applications
The ILTP Problem Library for Intuitionistic Logic

Journal of Automated Reasoning
A Cut-Free Sequent Calculus for Bi-intuitionistic Logic

TABLEAUX '07 Proceedings of the 16th international conference on Automated Reasoning with Analytic Tableaux and Related Methods
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
Deep Inference in Bi-intuitionistic Logic

WoLLIC '09 Proceedings of the 16th International Workshop on Logic, Language, Information and Computation
Sound Global State Caching for ALC with Inverse Roles

TABLEAUX '09 Proceedings of the 18th International Conference on Automated Reasoning with Analytic Tableaux and Related Methods
Proof Search and Counter-Model Construction for Bi-intuitionistic Propositional Logic with Labelled Sequents

TABLEAUX '09 Proceedings of the 18th International Conference on Automated Reasoning with Analytic Tableaux and Related Methods
An Experimental Comparison of Theorem Provers for CTL

TIME '11 Proceedings of the 2011 Eighteenth International Symposium on Temporal Representation and Reasoning

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 give Binary Decision Diagram (BDD) based methods for deciding validity and satisfiability of propositional Intuitionistic Logic Int and Bi-intuitionistic Tense Logic BiKt. We handle intuitionistic implication and bi-intuitionistic exclusion by treating them as modalities, but the move to an intuitionistic basis requires careful analysis for handling the reflexivity, transitivity and antisymmetry of the underlying Kripke relation. BiKt requires a further extension to handle the interactions between the intuitionistic and modal binary relations, and their converses. We explain our methodology for using the Kripke semantics of these logics to constrain the underlying least and greatest fixpoint approaches of the finite model construction. With some optimisations this technique is competitive with the state of the art theorem provers for Intuitionistic Logic using the ILTP benchmark and randomly generated formulae.