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

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

2009-06-08

arxiv.org/abs/0906.1489v1

Computer Science

Logic in Computer Science

Scientific paper

10.1016/j.jal.2010.08.001

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 paper, we investigate the effect of restricting the propositional part of the language on decidability and on the complexity of the satisfiability problem over arbitrary, transitive, total frames, and frames based on equivalence relations. We also consider different sets of modal and hybrid operators. We trace the border of decidability and give the precise complexity of most fragments, in particular for all fragments including negation. For the monotone fragments, we are able to distinguish the easy from the hard cases, depending on the allowed set of operators.

Affiliated with

Also associated with

No associations

Rating

The Complexity of Satisfiability for Fragments of Hybrid Logic -- Part I does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with The Complexity of Satisfiability for Fragments of Hybrid Logic -- Part I, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and The Complexity of Satisfiability for Fragments of Hybrid Logic -- Part I will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-232115