A Bi-Intuitionistic Modal Logic: Foundations and Automation

Stell, J. G., Schmidt, R. A. and Rydeheard, D. (2016)

Journal of Logical and Algebraic Methods in Programming 85 (4), 500-519. BiBTeX, DOI Link to Elsevier.

The paper introduces a bi-intuitionistic modal logic, called BISKT, with two adjoint pairs of tense operators. The semantics of BISKT is defined using Kripke models in which the set of worlds carries a pre-order relation as well as an accessibility relation, and the two relations are linked by a stability condition. A special case of these models arises from graphs in which the worlds are interpreted as nodes and edges of graphs, and formulae represent subgraphs. The pre-order is the incidence structure of the graphs. We present a comprehensive study of the logic, giving decidability, complexity and correspondence results. We also show the logic has the effective finite model property. We present a sound, complete and terminating tableau calculus for the logic and use the MetTeL system to explore implementations of different versions of the calculus. An experimental evaluation gave good results for satisfiable problems using predecessor blocking.

Accompanying website with the MetTeL specification of the tableau calculus for BISKT and the generated prover.

Renate A. Schmidt
Home | Publications | Tools | FM Group | School | Man Univ

Last modified: 23 Jun 16
Copyright © 2013-6 Renate A. Schmidt, School of Computer Science, Man Univ, schmidt@cs.man.ac.uk