#### Filter Results:

- Full text PDF available (14)

#### Publication Year

2008

2017

- This year (2)
- Last 5 years (11)
- Last 10 years (16)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn 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)

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

Article history: Received 24 February 2012 Received in revised form 12 February 2013 Accepted 16 February 2013 Available online 18 February 2013

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)

- 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)

- Wiebe van der Hoek, Petar Iliev, Barteld P. Kooi
- CiE
- 2012

The growing number of logics has lead to the question: How do we compare two formalisms? A natural answer is: We can compare their expressive power and computational properties. There is, however, another way of comparing logics that has attracted attention recently, namely in terms of representational succinctness, i.e., we can ask whether one of the… (More)

- Petar Iliev
- 2013

- Wiebe van der Hoek, Petar Iliev
- AAMAS
- 2014

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)

- 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)

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)

Acute phase response (APR) is activated by disorders in systemic homeostasis. The main purpose of APR is to prevent further tissue damage by isolation and destruction of causative agent, removing the toxic products and providing conditions for tissue repair. Probably the most significant change during APR is a transformation in the liver protein spectrum… (More)