Characterizing Successful Formulas: the Multi-agent Case
Multiagent Systems
2012-09-06 v1 Logic in Computer Science
Abstract
Characterization of successful formulas in Public Announcement Logic (PAL) is a well known open problem in Dynamic Epistemic Logic. Recently, Holliday and ICard have given a complete characterization for the single agent case. However, the problem for the multi-agent case is open. This paper gives a partial solution to the problem, characterizing the subclass of the language consisting of unary operators, and discusses methods to give a complete solution.
Keywords
Cite
@article{arxiv.1209.0935,
title = {Characterizing Successful Formulas: the Multi-agent Case},
author = {Sanchit Saraf and Sumit Sourabh},
journal= {arXiv preprint arXiv:1209.0935},
year = {2012}
}