A guide to completeness and complexity for modal logics of knowledge and belief
Artificial Intelligence
Multimodal logic programming using equational and order-sorted logic
Theoretical Computer Science - Selected papers of the Second International Conference on algebraic and logic programming, Nancy, France, October 1–3, 1990
Reasoning about knowledge
Epistemic Logic for AI and Computer Science
Epistemic Logic for AI and Computer Science
Single Step Tableaux for Modal Logics
Journal of Automated Reasoning
A New Space Bound for the Modal Logics K4, KD4 and S4
MFCS '99 Proceedings of the 24th International Symposium on Mathematical Foundations of Computer Science
Gentzen-type systems and resolution rules. Part I. Propositional logic
COLOG '88 Proceedings of the International Conference on Computer Logic
Labelled Tableaux for Multi-Modal Logics
TABLEAUX '95 Proceedings of the 4th International Workshop on Theorem Proving with Analytic Tableaux and Related Methods
A Tableau for Multimodal Logics and Some (Un)Decidability Results
TABLEAUX '98 Proceedings of the International Conference on Automated Reasoning with Analytic Tableaux and Related Methods
Improved Decision Procedures for the Modal Logics K, T, and S4
CSL '95 Selected Papers from the9th International Workshop on Computer Science Logic
Artificial Intelligence: A Modern Approach
Artificial Intelligence: A Modern Approach
Theoretical Computer Science
Rational Teams: Logical Aspects of Multi-Agent Systems
Fundamenta Informaticae - Multiagent Systems (FAMAS'03)
Foundations of Modal Deductive Databases
Fundamenta Informaticae
Hi-index | 0.00 |
We develop clausal tableau calculi for six multimodal logics variously designed for reasoning about multi-degree belief, reasoning about distributed systems of belief and for reasoning about epistemic states of agents in multi-agent systems. Our tableau calculi are sound, complete, cut-free and have the analytic superformula property, thereby giving decision procedures for all of these logics. We also use our calculi to obtain complexity results for five of these logics. The complexity of the remaining logic was known.