As UML 2.0 is evolving into a family of languages with individually specified semantics, there is an increasing need for automated and provenly correct model transformations that (i) assure the integration of local views (different diagrams) of the system into a consistent global view, and, (ii) provide a well–founded mapping from UML models to different semantic domains (Petri nets, Kripke aut...

Duration calculus is a logical formalism designed for expressing and refining real-time requirements for systems. Timed frames are essentially transition systems meant for modeling the time-dependent behaviour of programs. We investigate the interpretation of duration calculus formulae in timed frames. We elaborate this topic from different angles and show that they agree with each other. The r...

In this paper we address the relationship between questions as grammatical and semantic entities and questions as pragmatic entities arguing that a contextually-conditioned association holds between the former, as interrogative formulae, and the latter, as particular types of speech acts (namely offers and requests). This argument is supported by evidence from a corpus of spontaneous Cypriot Gr...

As UML 2.0 is evolving into a family of languages with individually specified semantics, there is an increasing need for automated and provenly correct model transformations that (i) assure the integration of local views (different diagrams) of the system into a consistent global view, and, (ii) provide a well– founded mapping from UML models to different semantic domains (Petri nets, Kripke au...

Akash Deshpande and Pravin Varaiya [email protected], [email protected] Department of Electrical Engineering and Computer Sciences University of California at Berkeley, Berkeley, California 94720 Abstract We describe the propositional linear temporal logic (PLTL) formalism and introduce the notions of observations, actions and control in PLTL. We develop the 0-lag and 0-lead possi...

In this paper simple formulae are derived for calculating the number of spanning trees of different product graphs. The products considered in here consists of Cartesian, strong Cartesian, direct, Lexicographic and double graph. For this purpose, the Laplacian matrices of these product graphs are used. Form some of these products simple formulae are derived and whenever direct formulation was n...

We develop and implement a novel algorithm for discovering the optimal sets of premisses for proving and disproving conjectures in first-order logic. The algorithm uses interpretations to semantically analyze the conjectures and the set of premisses of the given theory to find the optimal subsets of the premisses. For each given conjecture the algorithm repeatedly constructs interpretations usi...

Semantic coordination, namely the problem of finding an agreement on the meaning of heterogeneous schemas, is one of the key issues in the development of the Semantic Web (see [11, 10, 9, 8, 3, 5, 7, 1, 4, 6] for examples of proposed techniques). In environments with more or less well-defined boundaries, like a corporate Intranet, the problem of semantic coordination can be addressed a priori b...

this paper examines the semantic contribution of -?r and -andeh suffixes in persian based on lieber’s (2004) lexical semantic representation. this framework using six semantic features ([material], [dynamic], [location], [ieps] , [b] and [ci] and a principle called coordination principle studies the semantic contribution of lexical items including affixes and their functions in compounding, der...

Categories are not invariant. This paper attempts to explore the dynamic nature of semantic category, in particular, that of fashion language, based on the cognitive theory of Dawkins’ memetics, a new theory of cultural evolution. Semantic attributes of linguistic memes decrease or proliferate in replication and spreading, which involves a dynamic development of semantic category. More specific...