We consider the nonstandard constrained KP (ncKP) hierarchy which is obtained from the multi-constraint KP hierarchy by gauge transformation. The second Hamiltonian structure of the ncKP hierarchy can be simplified by factorizing the Lax operator into multiplication form, thus the generalized Miura transformation is obtained. We also discuss the free field realization of the associated W-algebra.

In this squib I discuss an unusual type of reduplication in which the reduplicant varies not only in terms of its phonemic composition but also in terms of its prosodic shape. The variability in the shape of the reduplicant results from a grammar that does not impose any constraint particular to the shape of the reduplicant per se. Further, I demonstrate that even in cases where the reduplicant...

This paper focuses on how multiparadigm – namely, constraint, object-oriented and higher-order – programming can be drawn upon not only to specify multiparameterized linguistic realization engines but also and above all to rationalize their configuration into full-fledged generation modules for specific language-application pairs. We describe Manati, one such engine whose instantiations render ...

In this squib I discuss an unusual type of reduplication in which the reduplicant varies not only in terms of its phonemic composition but also in terms of its prosodic shape. The variability in the shape of the reduplicant results from a grammar that does not impose any constraint particular to the shape of the reduplicant per se. Further, I demonstrate that even in cases where the reduplicant...

We present an extension of constraint logic programming, where the admissible constraints are arbitrary first-order formulas over some domain. Constraint solving is realized by effective quantifier elimination. The current realization in our CLP(RL) system provides as possible domains R, C, and Qp for primes p. In R and C we admit arbitrary degrees in our constraints. In Qp we restrict to linea...

We introduce the most recent and advanced implementation of constraint handling rules (CHR) in a logic programming language, which improves both on previous implementations (in terms of completeness , exibility and eeciency) and on the principles that should guide such a Prolog implementation consisting of a runtime system and a compiler. The runtime system utilizes attributed variables for the...

In this paper, we investigate the interaction of phonological and syntactic constraints on the realization of Information Structure in Greek, a free word order language. We use magnitude estimation as our experimental paradigm, which allows us to quantify the influence of a given linguistic constraint on the acceptability of a sentence. We present results from two experiments. In the first expe...

This paper is the second of two companion papers. The foundations of the proposed method of heuristic constraint enforcement on membership functions for knowledge extraction from a fuzzy/neural architecture was given in Part I. Part II develops methods for forming constraint sets using the constraints and techniques for finding acceptable solutions that conform to all available a priori informa...

The purpose of this paper is to reconsider the phonology of English nasal-final prefixes within the framework of Optimality Theory, especially making use of a relation of correspondence. In this paper, I show that compared with previous analyses employing rules and their extrinsic orderings, a constraint-based approach can give a better account of the phenomenon. In order to do this, following ...