We present the design of a le system whose organization is based on Concept Analysis à la WilleGanter . The aim is to combine querying and navigation facilities in one formalism. The le system is supposed to o er a standard interface but the interpretation of common notions like directories is new. The contents of a le system is interpreted as a Formal Context, directories as Formal Concepts, a...

This paper is focused on formal modeling of low-level interaction between holons. Using as formal methods the Place/Transition nets and Net Condition/Event systems (NCESs) we have developed some models for a communication and control mechanism between three production facilities sharing a common resource. The resource is represented by a shared route area on which each production facility deliv...

Starting from the speci cation of a small imperative programming language, and the description of two program transformations on this language, we formally prove the correctness of these transformations. The formal speci cations are given in a single format, and can be compiled into both executable tools and collections of de nitions to reason about into a theorem prover. This work is a case st...

This research investigates masculine and feminine in Arabic, aiming at highlighting the formal semantic limits set by Arab linguists for each of them. Two further issues constitute aim this research: first: reality indicators feminization, extent their conformity with reality, The second is to explain cause existence these signs refute idea classical that they came restrict proliferation words....

We present a system to translate natural language sentences to formulas in a formal or a knowledge representation language. Our system uses two inverse λ-calculus operators and using them can take as input the semantic representation of some words, phrases and sentences and from that derive the semantic representation of other words and phrases. Our inverse λ operator works on many formal langu...

This [kind of semiformal proof] is difficult to define precisely, but what I have in mind is the type of proof that most mathematicians would consider complete and rigorous, but that is not strictly formal in the sense of a purely syntactic derivation using a very precise and circumscribed formal set of rules of inference. In other words, I have in mind the type of proof found in a typical text...

The use of automata as a specification tool is analyzed. Trace Assertion Method (TAM) is used as an example. TAM is a formal method for specifying module interfaces. It treats the module as a black box, and was designed as an alternative to an algebraic specification technique [1], and became quite popular in the software industry [13]. Finiteness and concurrency issues are discussed. Key–Words...

Children use time words like minute and hour early in development, but take years to acquire their precise meanings. Here we investigate whether children assign meaning to these early usages, and if so, how. To do this, we test their interpretation of seven time words: second, minute, hour, day, week, month, and year. We find that preschoolers infer the orderings of time words (e.g., hour>minut...

We consider the problem of simultaneously compressing a finite set of words by a single grammar. The central result of this paper is the construction of an incompressible sequence of finite word languages. This result is then shown to transfer to tree languages and (via a previously established connection between proof theory and formal language theory) also to formal proofs in first-order pred...

The resultant is an algebraic expression, computable in a finite number of arithmetic operations from the coefficients of two univariate polynomials, that vanishes if, and only if, the two polynomials have common zeros. The paper considers formal resultant for degree-deficient polynomials (polynomials whose actual degree is lower than their assumed degree). Some key properties of the resultant ...