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

#### Journals and Conferences

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

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

- Vera Stebletsova
- 1998

Extending an original idea of B Jonsson R Lyndon showed in Lyndon how to con struct relation algebras boolean algebras with the binary operator composition the unary operator converse and the constant identity which satisfy the so called Tarski axioms see Henkin et alii J onsson Tarski from projective geometries thus providing a method for deriving… (More)

where 1 denotes the universal relation on the base set. These Q-operations have a geometrical origin, but in [Jónsson 1991] Jónsson discusses them only in a context where he compares the expressive power of various clones of operations on binary relations. For instance, the operation defined in the picture above does not belong to the Tarski clone; that is,… (More)

- Vera Stebletsova
- RelMiCS
- 1997

- Vera Stebletsova, Yde Venema
- RelMiCS
- 1997

- Vera Stebletsova
- Studia Logica
- 2000

We consider n ary relative products jn on subsets of a re exive and symmetric binary relation and de ne a variety of weakly associative relation algebras with polyadic composi tion operations WA A theorem that any A WA is representable over a re exive and symmetric relation is proved We also show that the equational theory of WA is decidable

- ‹
- 1
- ›