Computer Science – Computational Complexity
Scientific paper
2008-04-17
Computer Science
Computational Complexity
32 pages, 3 figures. Some of the results appeared in STACS 2006
Scientific paper
It is well known that modal satisfiability is PSPACE-complete (Ladner 1977). However, the complexity may decrease if we restrict the set of propositional operators used. Note that there exist an infinite number of propositional operators, since a propositional operator is simply a Boolean function. We completely classify the complexity of modal satisfiability for every finite set of propositional operators, i.e., in contrast to previous work, we classify an infinite number of problems. We show that, depending on the set of propositional operators, modal satisfiability is PSPACE-complete, coNP-complete, or in P. We obtain this trichotomy not only for modal formulas, but also for their more succinct representation using modal circuits. We consider both the uni-modal and the multi-modal case, and study the dual problem of validity as well.
Hemaspaandra Edith
Schnoor Henning
Schnoor Ilka
No associations
LandOfFree
Generalized Modal Satisfiability 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 Generalized Modal Satisfiability, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Generalized Modal Satisfiability will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-506420