#### Filter Results:

- Full text PDF available (13)

#### Publication Year

1982

2014

- This year (0)
- Last 5 years (1)
- Last 10 years (14)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn More

- Cédric Dégremont, Lena Kurzen, Jakub Szymanik
- Synthese
- 2014

We analyse the computational complexity of comparing informational structures. Intuitively, we study the complexity of deciding queries such as the following: Is Alice’s epistemic information strictly coarser than Bob’s? Do Alice and Bob have the same knowledge about each other’s knowledge? Is it possible to manipulate Alice in a way that she will have the… (More)

- Cédric Dégremont, Lena Kurzen
- KRAMAS
- 2008

The majority of formal approaches to analogy models analogies as structure preserving mappings from source to target domain. Bipin Indurkhya developed a formal theory of analogies and cognitive processes in general, where source and target are represented as concept networks, which are special kinds of algebras. The relation between them is modeled as an… (More)

In this thesis, a logic for reasoning about cooperative ability, actions and preferences is developed. It is an extention of a cooperation logic with actions, developed by Sauro et al., which is a modular modal logic consisting of an environment module for reasoning about actions and their effects and an agents module for reasoning about the cooperative… (More)

In formal approaches to inductive learning, the ability to learn is understood as the ability to single out a correct hypothesis from a range of possibilities. Although most of the existing research focuses on the characteristics of the learner, in many paradigms the significance of the teacher’s abilities and strategies is in fact undeniable. Motivated by… (More)

- Lena Kurzen
- Synthese
- 2009

- Lena Kurzen, Lena Kurzen
- 2011

219

- Lena Kurzen
- 2010

This paper analyzes the computational complexity of the inductive inference game Eleusis. Eleusis is a card game in which one player constructs a secret rule which has to be discovered by the other players. We determine the complexity of various decision problems that arise in Eleusis. We show that on the one hand, many of the problems are solvable in… (More)