This paper introduces a temporal logic based on precedence constraints among events which captures net semantics, i.e. a particular net can be mapped into a semantic-equivalent formula in the logic. Tempo, a declarative concurrent programming language, is based on such logic and has a procedural interpretation which allows speciications to be executed as concurrent programs. Thus, the execution...

This paper introduces a semantic theo-semantics can interpret the temporal and modal sense and anaphora. At present there are three main aspects in semantical field: 1. Transformation of' sentences or discourses into formulas in high order logic. 2. Semantic interpretation of the logical formulas. 3. Semantic ambiguity. This paper presents the semantics, dynamic logic with possible world, which...

We give a sufficient condition under which every finite-satisfiable formula of given PCTL fragment has model with at most doubly exponential number states (consequently, the finite satisfiability problem for is in \(\mathbf{2}\text {-}{} \mathbf{EXPSPACE}\)). The semantic and it based on enforcing form “progress” non-bottom SCCs contributing to satisfaction formula. show that satisfied by fragm...

To date, little research on pragmatic transfer has considered a multilingual situation where there is an interaction among three different languages spoken by one person. Of interest was whether pragmatic transfer of refusals among three languages spoken by the same person occurs from L1 and L2 to L3, L1 to L2 and then to L3 or from L1 and L1 (if there are more than one L1) to L2. This study ai...

While there is a generic agreement that formal semantic specifications could resolve ambiguities in modeling languages, in practice, languages are often developed without such unambiguous specifications. In this paper, I propose a logic-based infrastructure for the specification of Domain-Specific Modeling Languages (DSML). The key advantage of the approach is the executability of the specifica...

In this paper we describe QUBE++, an efficient solver for Quantified Boolean Formulas (QBFs). To the extent of our knowledge, QUBE++ is the first QBF reasoning engine that uses lazy data structures both for unit clauses propagation and for pure literals detection. QUBE++ also features non-chronological backtracking and a branching heuristic that leverages the information gathered during the bac...

This paper attempts to systematize natural language analysis process by (I) use of a partitioned semantic network formalism as the meaning representation and (2) stepwise translation based on Montague Grammar. The meaning representation is obtained in two steps. The first step translates natural language into logical expression. The second step interprets logical expression to generate network ...

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...