The Complexity of Satisfiability for Fragments of Hybrid Logic -- Part I

Arne Meier, Martin Mundhenk, Thomas Schneider +3

The satisfiability problem of hybrid logics with the downarrow binder is known to be undecidable. This initiated a research program on decidable and tractable fragments. In this pa…