On the Complexity of Elementary Modal Logics

Details On the Complexity of Elementary Modal Logics On the Complexity of Elementary Modal Logics

2008-02-13

arxiv.org/abs/0802.1884v1

Computer Science

Computational Complexity

Full version of STACS 2008 paper

Scientific paper

Modal logics are widely used in computer science. The complexity of modal satisfiability problems has been investigated since the 1970s, usually proving results on a case-by-case basis. We prove a very general classification for a wide class of relevant logics: Many important subclasses of modal logics can be obtained by restricting the allowed models with first-order Horn formulas. We show that the satisfiability problem for each of these logics is either NP-complete or PSPACE-hard, and exhibit a simple classification criterion. Further, we prove matching PSPACE upper bounds for many of the PSPACE-hard logics.

Affiliated with

Also associated with

No associations

Rating

On the Complexity of Elementary Modal Logics 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 On the Complexity of Elementary Modal Logics, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and On the Complexity of Elementary Modal Logics will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-676968