#### Filter Results:

- Full text PDF available (6)

#### Publication Year

1994

2012

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

#### Publication Type

#### Co-author

#### Publication Venue

#### Key Phrases

Learn More

- Johan van Benthem, Jan van Eijck, Vera Stebletsova
- J. Log. Comput.
- 1994

Transition systems can be viewed either as process diagrams or as Kripke structures. The rst perspective is that of process theory, the second that of modal logic. This paper shows how various formalisms of modal logic can be brought to bear on processes. Notions of bisimulation can not only be motivated by operations on transition systems, but they can… (More)

- Vera Stebletsova
- 1998

- Vera Stebletsova, Yde Venema
- J. Symb. Log.
- 2001

With each projective geometry we can associate a Lyndon algebra. Such an algebra always satisfies Tarski's axioms for relation algebras and Lyndon algebras thus form an interesting connection between the fields of projective geometry and algebraic logic. In this paper we prove that if G is a class of projective geometries which contains an infinite… (More)

In this paper an agent-based ambient system is presented to support persons in learning specific movement patterns. The ambient system serves as a personal coach that observes a person's movement pattern, and analyses this based on comparison with an ideal pattern generated by optimisation using a computational musculoskeletal model for this type of pattern… (More)

- Vera Stebletsova
- RelMiCS
- 1997

The paper [Jónsson 1991] contains a discussion and comparison of a number of possible operations on binary relations. Among these are the so-called Q-operations that are defined as follows. Definition 1.1 Let R be a matrix of binary relations R ij , 0 ≤ i, j < n, and let k, l be two numbers smaller than n, to be called reference points 1. Then Q kl n (R) is… (More)

- Vera Stebletsova
- Studia Logica
- 2000

We consider n-ary relative products j n on subsets of a reeexive and symmetric binary relation and deene a variety of weakly associative relation algebras with polyadic composition operations (WA 1). A theorem that any A2 WA 1 is representable over a reeexive and symmetric relation is proved. We also show that the equational theory of WA 1 is decidable.

- Vera Stebletsova, Yde Venema
- RelMiCS
- 1997

- ‹
- 1
- ›