A simple tableau system for the logic of elsewhere

Stéphane Demri (1, 2)

1 Leibniz - IMAG - Laboratoire Leibniz
2 CNRS - Centre National de la Recherche Scientifique

We analyze different features related to the mechanization of von Wright's logic of elsewhere ε. First, we give a new proof of the NP-completeness of the satisfiability problem (giving a new bound for the size of models of the satisfiable formulae) and we show that this problem becomes linear-time when the number of propositional variables is bounded. Although ε and the well-known propositional modal S5 share numerous common features we show that ε is strictly more expressive than S5 (in a sense to be specified). Second, we present a prefixed tableau system for ε and we prove both its soundness and completeness. Two extensions of this system are also defined, one related to the logical consequence relation and the other related to the addition of modal operators (without increasing the expressive power). An example of tableau proof is also presented. Different continuations of this work are proposed, one of them being to implement the defined tableau system, another one being to extend this system to richer logics that can be found in the literature.

Mots clés: satisfiability problem; prefixed tableau system; modal logic; complexity; von Wright's logic of elsewhere; small model property

Domaines: Informatique [cs]; Logique en informatique [cs.LO]; Intelligence artificielle [cs.AI]

Stéphane Demri. A simple tableau system for the logic of elsewhere. 5th International Workshop on Theorem Proving with Analytic Tableaux and Related Methods (TABLEAUX '96), May 1996, Palerme, Italy. pp.177-192, ⟨10.1007/3-540-61208-4_12⟩. ⟨hal-03195223⟩