A Tableaux Based Decision Procedure for a Broad Class of Hybrid Formulae with Binders

In this paper we provide the first (as far as we know) direct calculus deciding satisfiability of formulae in negation normal form in the fragment of hybrid logic with the satisfaction operator and the binder, where no occurrence of the $\Box$ operator is in the scope of a binder. A preprocessing step, rewriting formulae into equisatisfiable ones, turns the calculus into a satisfiability decision procedure for the fragment \mbox{$\Hl(@,\binder)$} $\setminus\Box \binder\Box$, {\ie} formulae in negation normal form where no occurrence of the binder is both in the scope of and contains in its scope a $\Box$ operator. The calculus is based on tableaux, where nominal equalities are treated by means of substitution, and termination is achieved by means of a form of anywhere blocking with indirect blocking. Direct blocking is a relation between nodes in a tableau branch, holding whenever the respective labels (formulae) are equal up to (a proper form of) nominal renaming. Indirect blocking is based on a partial order on the nodes of a tableau branch, which arranges them into a tree-like structure.