Journal of Logical and Algebraic Methods in Programming · 2015 · 21 citations · 17 references
HumanitiesComputer ScienceMathematicsFormal MethodsLogicTheory Of ComputationDeductive ReasoningIntuitionistic LogicModal LogicModal SemanticsModel CheckingModel TheoryAdjoint FormulationAdjoint TransformationDecidability In Intuitionistic LogicIntuitionistic Modal LogicKripke StructuresModal ReasoningOperatorsTableau Algorithms
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.
17
Image analysis and mathematical morphology
Computer Graphics and Image Processing · 1982 · 8.2K citations
Hiroyuki Nakano, S. Romberger · 1974 · 670 citations
A formalization of the propositional calculus of H-B logic
Cecylia Rauszer · Studia Logica · 1974 · 106 citations
Marco Aiello, Johan van Benthem · Journal of Applied Non-Classical Logics · 2002 · 90 citations