Tableau-Based Procedure for Deciding Satisfiability in the Full Coalitional Multiagent Epistemic Logic

DOI10.1007/978-3-540-92687-0_14zbMath1211.03027arXiv0902.2125OpenAlexW1667861512MaRDI QIDQ3605530

Dmitry Shkatov, Valentin F. Goranko

Publication date: 24 February 2009

Published in: Logical Foundations of Computer Science (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/0902.2125

Mathematics Subject Classification ID

Logic in artificial intelligence (68T27) Logics of knowledge and belief (including belief change) (03B42) Agent technology and artificial intelligence (68T42)

Related Items (3)

Undecidability of QLTL and QCTL with two variables and one monadic predicate letter ⋮ Invariant-free clausal temporal resolution ⋮ Temporal Aspects of the Dynamics of Knowledge

Uses Software

• TATL

Cites Work

• A guide to completeness and complexity for modal logics of knowledge and belief
• Tableau-based decision procedures for logics of strategic ability in multiagent systems
• Knowledge and common knowledge in a distributed environment
• MAKING SOME ISSUES OF IMPLICIT KNOWLEDGE EXPLICIT
• What can machines know?
• Tableau-based decision procedure for the multiagent epistemic logic with all coalitional operators for common and distributed knowledge
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Tableau-Based Procedure for Deciding Satisfiability in the Full Coalitional Multiagent Epistemic Logic