This article presents predominant views of the English and Thai ditransitive dative sentence structures that take verbs to have two major meanings based on schemata: a caused possession motion. The main purpose study was investigate associations between their event schemata, syntactic semantic realizations available structures, parallel sentences across languages. participants were pre-service ...

Task-decomposition planners make use of schemata that de ne tasks in terms of partially ordered sets of tasks and primitive actions. Most existing taskdecomposition planners synthesize plans via a topdown approach, called task reduction, which uses schemata to replace tasks with networks of tasks and actions until only actions remain. In this paper we present a bottom-up plan parsing approach t...

Task-decomposition planners make use of schemata that de ne tasks in terms of partially ordered sets of tasks and primitive actions. Most existing taskdecomposition planners synthesize plans via a topdown approach, called task reduction, which uses schemata to replace tasks with networks of tasks and actions until only actions remain. In this paper we present a bottom-up plan parsing approach t...

We give a recursion-theoretic characterization of the complexity classes NC for k ≥ 1. In the spirit of implicit computational complexity, it uses no explicit bounds in the recursion and also no separation of variables is needed. It is based on three recursion schemes, one corresponds to time (time iteration), one to space allocation (explicit structural recursion) and one to internal computati...

Coiterative functions can be explained categorically as final coalgebraic morphisms, once coinductive types are viewed as final coalgebras. However, the coiteration schema which arises in this way is too rigid to accommodate directly many interesting classes of circular specifications. In this paper, building on the notion of T -coiteration introduced by the third author and capitalizing on rec...