A guide to completeness and complexity for modal logics of knowledge and belief
type: Item
instance of: scholarly article
title: A guide to completeness and complexity for modal logics of knowledge and belief
zbMATH Open document ID: 0762.68029
DOI: 10.1016/0004-3702(92)90049-4
author: Joseph Y. Halpern
author: Yoram Moses
published in: Artificial Intelligence
publication date: 1992-09-27T00:00:00Z
Mathematics Subject Classification ID: 68Q25
Mathematics Subject Classification ID: 68T30
Mathematics Subject Classification ID: 03B45
zbMATH DE Number: 64740
zbMATH Keywords: reasoning about knowledge and belief
zbMATH Keywords: possible-worlds semantics
zbMATH Keywords: decision procedures
zbMATH Keywords: distributed knowledge
zbMATH Keywords: \(NP\)-complete
zbMATH Keywords: PSPACE-complete
MaRDI profile type: Publication
full work available at URL: 0004-3702(92)90049-4
OpenAlex ID: W2076073997
cites work: The foundations of mathematics. A study in the philosophy of science
cites work: Alternation
cites work: Q3867808
cites work: Q4138187
cites work: Knowledge and common knowledge in a Byzantine environment: Crash failures
cites work: Decision procedures and expressiveness in the temporal logic of branching time
cites work: Belief, awareness, and limited reasoning
cites work: What can machines know?
cites work: Interpreting logics of knowledge in propositional dynamic logic
cites work: Propositional dynamic logic of regular programs
cites work: Q3773852
cites work: The Knowledge Complexity of Interactive Proof Systems
cites work: Knowledge and common knowledge in a distributed environment
cites work: The complexity of reasoning about knowledge and time. I: Lower bounds
cites work: Impossible possible worlds vindicated
cites work: Q3862379
cites work: Q3026978
cites work: On the characterization of modalities
cites work: Q3241192
cites work: An elementary proof of the completeness of PDL
cites work: Semantical Analysis of Modal Logic I Normal Modal Propositional Calculi
cites work: The Computational Complexity of Provability in Systems of Modal Propositional Logic
cites work: Q4180316
cites work: Foundations of a functional approach to knowledge representation
cites work: All I know: A study in autoepistemic logic
cites work: On Some Completeness Theorems in Modal Logic
cites work: Q5633670
cites work: An Axiomatic Characterization of Common Knowledge
cites work: Q5203717
cites work: Programming simultaneous actions using common knowledge
cites work: Q3669369
cites work: Q5203719
cites work: Formal theories of knowledge in AI and robotics
cites work: A study of Kripke-type models for some modal logics by Gentzen's sequential method
cites work: Q5560258
cites work: Q4131648
description: scientific article; zbMATH DE number 64740