In this paper we report on the use of feature structures to represent the linguistic information of a corpus. This approach has been adopted in TyPTex, a project which aims at providing a generic architecture for corpora profiling. After a brief overview of the Typtex project, we show that corpora exploration requires manipulating linguistic features in order to obtain a required level of lingu...

We employ the Margenau-Hill (MH) correspondence rule for associating classical functions with quantum operators to construct quasi-probability mass functions. Using this we obtain fuzzy one parameter quasi measurement operator (QMO) characterizing incompatibility of non-commuting spin observables qubits, qutrits and 2-qubit systems. Positivity MH-QMO places upper bounds on associated unsharpnes...

Let X be an arbitrary nonempty set and a lattice of subsets of X such that φ, X∈ . ( ) is the algebra generated by and ( ) denotes those nonnegative, finite, finitely additive measures μ on ( ). I( ) denotes the subset of ( ) of nontrivial zeroone valued measures. Associated with μ ∈ I( ) (or Iσ ( )) are the outer measures μ′ and μ′′ considered in detail. In addition, measurability conditions a...

We describe three experiments using meta-language and meta-reasoning to solve problems involving belief, heuristics, and points of view. These experiments use the knowledge representation system SPHERE, built at Hewlett-Packard Laboratories and based on the ideas of FOL [20]. A key idea underlying our research is the segmentation of knowledge into contexts and the meta-linguistic treatment of t...

I examine the implementation of core allocations when agents are differently informed. A one state deviation principle (an allocation cannot be improved at any state) and measurability restrictions (blocking allocations may only be measurable with respect to each agent’s private information) are sufficient to yield interim core solutions that are Bayesian implementable. Private measurability of...

It is well-known that if we assume a large class of sets of reals to be determined then we may conclude that all sets in this class have certain regularity properties: we say that determinacy implies regularity properties classwise. In [Lö05] the pointwise relation between determinacy and certain regularity properties (namely the Marczewski-Burstin algebra of arboreal forcing notions and a corr...