Alongside theoretical logic, which systematises the proof schemata of theoretical truths, one can systematise the schemata of problem-solving, e.g. those of geometric construction problems. Then, corresponding to the principle of the syllogism, we find for example, the following principle: If we can reduce the solution of b to that of a, and reduce the solution of c to that of b, then we can al...

Most of the multimedia objects distributed over the WorldWide Web are unstructured or poorly meta-indexed to be of any use in retrieval tasks formulated by users in natural language queries. In general these dynamic multimedia objects are manually annotated in terms of textual documents. The high costs involved in manually indexing multimedia objects, which grow in volume and are becoming ever ...

|A new genetic algorithm which exploits an idea of \coevolution" is proposed. The proposed method consists of two GAs: Host GA and Parasite GA. The Host GA searches for the solutions, and these two GAs are closely related to each other. The Parasite GA plays an important role in searching for useful schemata in the Host GA. Furthermore, two methods of tness evaluation of Parasite GA are examine...

1 In Proceedings of the Twenty-Second Annual Conference of the Cognitive Science Society, (pp. 776-81, 2000). Mahwah, NJ: Erlbaum. Abstract Schemata are frequently used in cognitive science as a descriptive framework for explaining the units of knowledge. However, the specific properties which comprise a schema are not consistent across authors. In this paper we attempt to ground the concept of...

A data warehouse is an integrated and time-varying collection of data derived from operational data and primarily used in strategic decision making by means of OLAP techniques. Although it is generally agreed that warehouse design is a non-trivial problem and that multidimensional data models and star or snowflake schemata are relevant in this context, there exist neither methods for deriving s...

Most interesting proofs in mathematics contain an inductive argument which requires an extension of the LK-calculus to formalize. The most commonly used calculi for induction contain a separate rule or axiom which reduces the valid proof theoretic properties of the calculus. To the best of our knowledge, there are no such calculi which allow cut-elimination to a normal form with the subformula ...

The parsing schemata formalism allows us to describe parsing algorithms in a simple way by capturing their fundamental semantics while abstracting low-level detail. In this work, we present a compilation technique allowing automatic transformation of parsing schemata to executable implementations of their corresponding algorithms. Taking a simple description of a schema as input, our technique ...