Attempts to organize, summarize, or explain one's own behavior in a particular domain result in the formation of cognitive structures about the self or selfschemata. Self-schemata are cognitive generalizations about the self, derived from past experience, that organize and guide the processing of the self-related information contained in an individual's social experience. The role of schemata i...

Parsing schemata are de ned as an intermediate level of abstraction between context free grammars and parsers Clear concise speci cations of radically di erent parsing algo rithms can be expressed as parsing schemata Moreover because of the uniformity of these speci cations relations between di erent parsing algorithms can be formally established This article gives an introduction to the parsin...

Schemata and the schema theorem, although criticised, are often used to explain why genetic algorithms (GAs) work. A considerable research eeort has been produced recently to extend the GA schema theory to Genetic Programming (GP). In this paper we review the main results available to date in the theory of schemata for GP and some recent experimental work on schemata.

The aim of the Schematism chapter Critique Pure Reason is to solve problem posed by “inhomogeneity” intuitions and categories: sensible properties objects represented in intuition are a different kind than categories. Kant's solution introduce what he calls “transcendental schemata,” which mediate subsumption under I reconstruct terms two substantive premises, call Subsumption Sufficiency (i.e....

Reading comprehension means reading and understanding, an active process which can be seen as a kind of dialogue between the reader and the text or the author. We often hear our students say that they can read the words but don’t know what the words mean. This paper focuses on schema theory with special attention to content schemata, analyses the reasons of the students’ failure in reading, poi...

Graphical interface use involves schemata operations that range from transfer to induction. The former apply existing knowledge, such as prior schemata, and are effortless, preconscious and intuitive. The latter, which consist in constructing new schemata, are resource-consuming and thus detrimental to intuitive use (IV). A quantitative method is proposed to manipulate and screen schemata opera...

Schemata and the schema theorem, although criticised, are often used to explain why genetic algorithms (GAs) work. A considerable research eeort has been produced recently to extend the GA schema theory to Genetic Programming (GP). In this paper we review the main results available to date in the theory of schemata for GP and some recent experimental work on schemata.

My main purpose here is to provide an account of context selection in utterance understanding in terms of the role played by schemata and goals in top-down processing. The general idea is that information is organized hierarchically, with items iteratively organized in chunks-here called "schemata"-at multiple levels, so that the activation of any items spreads to schemata that are the most acc...

ABSTRACT Conceptual level database design should be managed independently of its implementation. Therefore, once a conceptual level schema has been completed, some transformation method must exist which can be used in the construction of an implementation level design supported by the target model (e.g., relational, objectoriented, network). This paper provides a method for the transformation o...

We investigate iterated schemata whose syntax integrates arithmetic parameters, indexed propositional variables (e.g. Pi), and iterated conjunctions/disjunctions (e.g. Vn i=1 Pi, where n is a parameter). Using this formalism gives us some extra information about the structure of the problem, which can be used in order to prove such a schema for all values of the parameters. The structure of the...