Abstract The use-mention distinction is elaborated into a four-way between use, formal mention, material mention and pragmatic mention. notion of motivated through the problem monsters in Kaplanian indexical semantics. It then formalized applied an account schemata languages.

The basic Schema Theorem for genetic algorithms is modiied for a grammatically-based learning system. A context-free grammar is used to deene a language in which each sentence is mapped to a tness value. The derivation trees associated with these sentences are used to deene the structure of schemata. The eeect of crossover and mutation on schemata is described. A schema theorem is developed whi...

We present the implementation of a system which extracts not only lexicalized grammars but also feature-based lexicalized grammars from Korean Sejong Treebank. We report on some practical experiments where we extract TAG grammars and tree schemata. Above all, full-scale syntactic tags and well-formed morphological analysis in Sejong Treebank allow us to extract syntactic features. In addition, ...

We present the foundations of critical pair analysis for the graph programming language GP 2. Our goal is to develop a static checker that can prove or refute confluence (functional behaviour) for a large class of graph programs. In this paper, we introduce symbolic critical pairs of GP 2 rule schemata, which are labelled with expressions, and establish the completeness and finiteness of the se...

An attempt has been made to use an Augmented Transition Network IO as a 'procedural dialog model'. The development of such a model appears to be important in several respects: as a device to represent and to use different dialog schemata proposed in empirical conversation analysis; as a device to represent and to use models of verbal interaction; as a device combining knowledge about dialog sch...

We introduce error-correcting parsing schemata, which allow us to define error-correcting parsers in a high-level, declarative way. This formalism can be used to describe error-correcting parsers in a simple and uniform manner, and provides a formal basis allowing to prove their correctness and other properties. We also show how these schemata can be used to obtain different implementations of ...

The study reported in this paper was aimed at investigating the existence of schemata specifically involved in the cognitive organization of a web page. Particularly, the hypothesis was that the location of some web objects (namely, links to specific contents) might be expected by the users at specific spatial locations. Results confirm that user’s expectations are due to the activity of “low” ...

In this paper we focus on optimization of database schema transformation, by evolutionary (or genetic) search. A framework for transforming conceptual data schemata into eecient internal schemata is presented. We consider this problem from the viewpoint of searching through the space of all correct, but possibly incomplete internal representations of the conceptual schema at hand. A search stra...

In this paper we rst review the main results in the theory of schemata in Genetic Programming (GP) and summarise a new GP schema theory which is based on a new deenition of schema. Then we study the creation, propagation and disruption of this new form of schemata in real runs, for standard crossover, one-point crossover and selection only. Finally, we discuss these results in the light our GP ...

In this article, we present a validation approach and method to support the development of database applications. We explain how validation can cope both with the need for a formalized evaluation of correctness as well as the need for prototyping of conceptual database schemata. We deene diierent levels of correctness for such schemata and show how these levels can be achieved through validatio...