60
Voted
STACS
2000
Springer
15 years 12 days ago
2000
Springer
Motivated by description logics, we investigate what happens to the complexity of modal satisfiability problems if we only allow formulas built from literals, , 3, and 2. Previous...