Reasoning about common knowledge with infinitely many agents

DOI10.1016/J.IC.2004.01.003zbMath1078.03014OpenAlexW1965555095MaRDI QIDQ598197

Joseph Y. Halpern, Richard A. Shore

Publication date: 6 August 2004

Published in: Information and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ic.2004.01.003

zbMATH Keywords

completenesssatisfiabilityepistemic logicaxiomatizationdecision procedurereasoning about knowledgeexponential complexityinfinitely many agents

Mathematics Subject Classification ID

Logic in artificial intelligence (68T27) Logics of knowledge and belief (including belief change) (03B42) Knowledge representation (68T30)

Related Items (11)

Quantified epistemic logics for reasoning about knowledge in multi-agent systems ⋮ Probabilistic Common Knowledge Among Infinite Number of Agents ⋮ Unnamed Item ⋮ Multi-agent logics for reasoning about higher-order upper and lower probabilities ⋮ Decidability of Hybrid Logic with Local Common Knowledge Based on Linear Temporal Logic LTL ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Inference Rules in Multi-agents’ Temporal Logics ⋮ Reasoning about distributed information with infinitely many agents ⋮ Decidability: theorems and admissible rules

Cites Work

• A guide to completeness and complexity for modal logics of knowledge and belief
• Agreeing to disagree
• Propositional dynamic logic of regular programs
• The effect of bounding the number of primitive propositions and the depth of nesting on the complexity of modal logic
• What can machines know?
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Reasoning about common knowledge with infinitely many agents