Formal semanticists have developed sophisticated compositional theories of sentential meaning, paying a lot of attention to those grammatical words (determiners, logical connectives, etc.) that constitute the functional scaffolding of sentences. Corpus-based computational linguists, on the other hand, have developed powerful distributional methods to induce representations of the meaning of con...

The research described in this paper aims at facilitating the process of drawing conclusions while working with incomplete information. The approach is based on formal concept analysis and six valued logic. The Armstrong axioms are further applied to obtain knowledge in cases with incomplete information. Key–Words: Formal concept analysis, incomplete information, logic

We propose a general approach to the formal Poisson cohomology of r-matrix induced quadratic structures, we apply this device to compute the cohomology of structure 2 of the Dufour-Haraki classification, and provide complete results also for the cohomology of structure 7. Key-words: Poisson cohomology, formal cochain, quadratic Poisson tensor, r-matrix 2000 Mathematics Subject Classification: 1...

The paper proposes and studies temporal logics for attributed words, that is, data words with a (finite) set of (attribute,value)-pairs at each position. It considers a basic logic which is a semantical fragment of the logic LTL1 of Demri and Lazic with operators for navigation into the future and the past. By reduction to the emptiness problem for data automata it is shown that this basic logi...

While most approaches to unsupervised morphology acquisition often rely on metrics based on information theory for identifying morphemes, we describe a novel approach relying on the notion of formal analogy, that is, a relation between four forms, such as: reader is to doer as reading is to doing. Our assumption is that formal analogies identify pairs of morphologically related words, for insta...

We solve a long-standing open problem on word equations by proving that if the words x0, . . . , xn satisfy the equation x0 = x1 · · ·xn for three positive values of k, then the words commute. One of our methods is to assign numerical values for the letters, and then study the sums of the letters of words and their prefixes. We also give a geometric interpretation of our methods. 1998 ACM Subje...

In the article the fact is verified that the list of words selected by formal statistical methods (frequency and functional genre unrestrictedness) is not a conglomerate of non-related words. It creates a system of interrelated items and it can be named “lexical base of language”. This selected list of words covers all the spheres of human activities. To verify this statement the invariant syno...

let ( r,m ) be a noetherian local ring, a an ideal of r and m a finitely generated r- module. we investigate some properties of formal local cohomology modules with respect to a serre subcategory. we provide a common language to indicate some properties of formal local cohomology modules. let ( r,m ) be a noetherian local ring, a an ideal of r and m a finitely generated r- module. we investigat...

The paper describes a technique for automatic generation of abstract models of memories that can be used for efficient formal verification of hardware designs. Our approach is able to handle addressing of different sizes of data, such as quad words, double words, words, or bytes, at the same time. The technique is also applicable for memories with multiple read and write ports, memories with re...