Theoretical Computer Science
Interpreting logics of knowledge in propositional dynamic logic with converse
Information Processing Letters
Modal logics for knowledge representation systems
Theoretical Computer Science
A guide to completeness and complexity for modal logics of knowledge and belief
Artificial Intelligence
Tolerance approximation spaces
Fundamenta Informaticae - Special issue: rough sets
The complexity of concept languages
Information and Computation
Knowledge discovery by application of rough set models
Rough set methods and applications
Rough Sets: Theoretical Aspects of Reasoning about Data
Rough Sets: Theoretical Aspects of Reasoning about Data
Incomplete Information: Rough Set Analysis
Incomplete Information: Rough Set Analysis
Rough Sets in Knowledge Discovery 2: Applications, Case Studies, and Software Systems
Rough Sets in Knowledge Discovery 2: Applications, Case Studies, and Software Systems
Rough-Fuzzy Hybridization: A New Trend in Decision Making
Rough-Fuzzy Hybridization: A New Trend in Decision Making
Single Step Tableaux for Modal Logics
Journal of Automated Reasoning
LFCS '94 Proceedings of the Third International Symposium on Logical Foundations of Computer Science
Complexity of Simple Dependent Bimodal Logics
TABLEAUX '00 Proceedings of the International Conference on Automated Reasoning with Analytic Tableaux and Related Methods
Dynamic Logic as a Uniform Framework for Theorem Proving in Intensional Logic
Proceedings of the 10th International Conference on Automated Deduction
The Nondeterministic Information Logic NIL is PSPACE-complete
Fundamenta Informaticae
| Hi-index | 0.00 |
We characterize the computational complexity of a family of approximation multimodal logics in which interdependent modal connectives are part of the language. Those logics have been designed to reason in presence of incomplete information in the sense of rough set theory. More precisely, we show that all the logics have a PSPACE-complete satisfiability problem and we define a family of tolerance approximation multimodal logics whose satisfiability is EXPTIME-complete. This illustrates that the PSPACE upper bound for this kind of multimodal logics is a very special feature of such logics. The PSPACE upper bounds are established by adequately designing Ladner-style tableaux-based procedures whereas the EXPTIME lower bound is established by reduction from the global satisfiability problem for the standard modal logic B.