The process of annotating text corpora involves establishing annotation schemata which define the scope and depth of an annotation task at hand. We demonstrate this activity in Argo, a Web-based workbench for the analysis of textual resources, which facilitates both automatic and manual annotation. Annotation tasks in the workbench are defined by building workflows consisting of a selection of ...

The key idea behind Cultural Algorithms is to explcitly acquire problem-solving knowledge (beliefs) from the evolving population in the form of schemata and in return apply that knowledge to guide the search [Reynolds 1993, 1996]. In solving nonlinear constraint optimization problems, the key problem is how to represent and store the knowledge about the constraints. Previously, Chung [1996, 199...

An approach to integrate explanation-based learning into computer algebra systems is given. Schemata are learned by generalizing explanations of a teacher and by generalizing numbers. We outline the architecture of an intelligent environment for learning mathematics and its advantages. A uniied treatment of mathematical rules and of schemata of an application leads to increased problem solving ...

This paper connects the conclusions of recent research on video games and learning to prior research on problem schemata and problem-solving. This study examines the problem-solving practices of expert and novice young players of Civilization III in a gamebased learning program, and concludes that the problem schemata framework has power and utility in analyzing problem-solving in game-based en...

The concept of schema and some general characteristics of models using schemata are discussed. It is shown by computer simulations how a combination of a number of simple neural circuits are capable of performing actions similar to those commonly attributed to schemata, especially self-organization of a representational code, recognition of spatial and temporal structure, adaptive performance a...

The cut-elimination method CERES (for firstand higherorder classical logic) is based on the notion of a characteristic clause set, which is extracted from an LK-proof and is always unsatisfiable. A resolution refutation of this clause set can be used as a skeleton for a proof with atomic cuts only (atomic cut normal form). This is achieved by replacing clauses from the resolution refutation by ...

Types are a useful mechanism for early error detection and optimization of any programming language. Semi-structured query evaluation as in Xcerpt needs to be able to cope without schema information or types, in contrast to the relational case. Nevertheless, if available, type information enables query optimization well beyond what is possible in its absence. Furthermore, since semi-structured ...

Task-decomposition planners make use of schemata that define tasks in terms of partially ordered sets of tasks and primitive actions. Most existing taskdecomposition planners synthesize plans via a topdown approach, called taslc 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 pursing approach...

This paper presents a detailed integration process for XML schemata called BInXS. BInXS adopts a global-as-view integration approach that builds a global schema from a set of heterogeneous XML schemata related to a same application domain. This bottom-up approach maps all element and attribute definitions in XML schemata to correspondent concepts at the global schema, allowing access to all dat...

Many problems can be specified by patterns of propositional formulae depending on a parameter, e.g. the specification of a circuit usually depends on the number of bits of its input. We define a logic whose formulae, called iterated schemata, allow to express such patterns. i=1 or n i=1 (called iterations) where n is an (unbound) integer variable called a parameter. The expressive power of iter...