#### Filter Results:

- Full text PDF available (11)

#### Publication Year

2008

2015

#### Publication Type

#### Co-author

#### Publication Venue

#### Key Phrases

Learn More

- Tim French, Wiebe van der Hoek, Petar Iliev, Barteld P. Kooi
- IJCAI
- 2011

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)

- Tim French, Wiebe van der Hoek, Petar Iliev, Barteld P. Kooi
- Artif. Intell.
- 2013

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)

- Petar Iliev
- 2013

- Hans van Ditmarsch, Jie Fan, Wiebe van der Hoek, Petar Iliev
- Advances in Modal Logic
- 2014

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)

- Wiebe van der Hoek, Petar Iliev, Michael Wooldridge
- AAMAS
- 2012

The last decade has been witness to a rapid growth of interest in logics intended to support reasoning about the interactions between knowledge and action. Typically, logics combining dynamic and epistemic components contain ontic actions (which change the state of the world, e.g., switching a light on) or epistemic actions (which affect the information… (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)

- Philippe Balbiani, Petar Iliev, Dimiter Vakarelov
- Fundam. Inform.
- 2008

The natural modal logic corresponding to Pawlak's approximation spaces is S5, based on the box modality [R]A (and the diamond modality RA = ¬[R]¬A), where R is the corresponding indiscernibility relation of the approximation space S = (W, R). However the expressive power of S5 is too weak and, for instance, we cannot express that the space S has exactly n… (More)

- Wiebe van der Hoek, Petar Iliev, Michael Wooldridge
- LORI
- 2011

We introduce and study the notion of a Public Environment: a system in which a publicly known program is executed in an environment that is partially observable to agents in the system. Although agents do not directly have access to all variables in the system, they may come to know the values of unobserved variables because they know how the program is… (More)

We introduce the notion of a Public Environment: a system in which a publicly known program is executed in an environment that is partially observable to agents in the system. Although agents do not directly have access to all variables in the system, they may come to know the values of unobserved variables because they know how the program is manipulating… (More)