We study the problem of maintaining recursively-de ned views, such as the transitive closure of a relation, in traditional relational languages that do not have recursion mechanis...
Relation models have treated multi-holed regions relations either the same as hole-free regions relations, loosing this way the peculiarities of the holed topology, or with methods...
This paper studies a text mining problem, comparative sentence mining. A comparative sentence expresses an ordering relation between two sets of entities with respect to some comm...
We consider bisimulation and weak bisimulation relations in the context of the Labeled Markov Chains of Hansson and Jonsson, the Concurrent Labeled Markov Chains of Philippou, Lee...
Trust dynamics can be modelled in relation to experiences. Both cognitive and neural models for trust dynamics in relation to experiences are available, but were not yet related or...