Petar Iliev

Learn More
Proving that one language is more succinct than another becomes harder when the underlying semantics is stronger. We propose to use Formula-Size Games (as put forward by Adler and Immerman, 2003), games that are played on two sets of models , and that directly link the length of play with the size of the formula. Using FSGs, we prove three succinctness(More)
In most cases authors are permitted to post their version of the article (e.g. in Word or Tex form) to their personal website or institutional repository. Authors requiring further information regarding Elsevier's archiving and manuscript policies are encouraged to visit: a r t i c l e i n f o a b s t r a c t Keywords: Knowledge representation Modal logic(More)
Fitch showed that not every true proposition can be known in due time; in other words, that not every proposition is knowable. Moore showed that certain propositions cannot be consistently believed. A more recent dynamic phrasing of Moore-sentences is that not all propositions are known after their announcement, i.e. not every proposition is successful.(More)
We present two families of exponential lower bounds on the size of modal formulae and use them to establish the following succinctness results. We show that the logic of contingency (ConML) is exponentially more succinct than basic modal logic (ML). We strengthen the known proofs that the so-called public announcement logic (PAL) in a signature containing(More)
Fitch showed that not every true proposition can be known in due time; in other words, that not every proposition is knowable. Moore showed that certain propositions cannot be consistently believed. A more recent dynamic phrasing of Moore-sentences is that not all propositions are known after their announcement, i.e., not every proposition is successful.(More)
In the study of knowledge representation formalisms, there is a current interest in the question of how different formal languages compare in their ability to compactly express semantic properties. Recently, French et al. [9] have shown that modal logics with a modality for public announcement, for everybody knows, and for somebody knows are all(More)