• Title/Summary/Keyword: formal semantics

Search Result 62, Processing Time 0.027 seconds

Interpretation of Korean Temporal Markers -ESS and -NUN in Interval Semantics

  • Yoo, Eun-Jung
    • Language and Information
    • /
    • v.3 no.2
    • /
    • pp.31-49
    • /
    • 1999
  • This paper deals with temporal markers -ess and -(nu)n in Korean, and provides formal interpretations of these markers within the framework of interval semantics. I propose that the truth-conditional interpretation of -ess and -(nu)n sentences is obtained by locating the involved eventuality within a 'completive interval' and 'imcompletive interval', respectively. Since characterization of these two invervals makes reference to the evaluation time, the basic distinction between the two lies on tense. Furthermore, I will argue that perfective/imperfective aspect meaning that usually arises in -ess/-nun sentences should be explained in terms of a conversational implicature.

  • PDF

Information Articulation and Truth Conditions of Existential Sentences

  • Kim, Yoo-Kyung
    • Language and Information
    • /
    • v.1
    • /
    • pp.67-105
    • /
    • 1997
  • This paper investigates the semantics of English there existential sentences. By examining discourse functions and pragmatic facts, it accounts for semantic facts which have not been discussed elsewhere. Further, it is a new attempt to incorporate information-theoretic notions into formal semantics. I propose that existential statements as expressing Austinian propositions. The proposed meanings account for the fact that post-copular NPs cannot constitute the restruction of an adverb of quantification nor admit a partitive reading.

  • PDF

A Formal Specification and Accuracy Checking of 2+1 View Integrated Metamodel Using Z and Object-Z (Z/Object-Z 사용한 2+1 View 통합 메타모델의 정형 명세와 명확성 검사)

  • Song, Chee-Yang
    • Journal of the Korea Academia-Industrial cooperation Society
    • /
    • v.15 no.1
    • /
    • pp.449-459
    • /
    • 2014
  • The proposed 2+1 view integrated metamodel defined formerly with a graphical class model can not be guaranteed the syntactic clarity and accuracy precisely for the metamodel due to the informal specification. This paper specifies the syntactic semantics formally for the 2+1 view integrated metamodel using Z and Object-Z and checks the accuracy of the metamodel with Z/Eves tool. The formal specification is expressed in Z and Object-Z schema separately for syntax and statics semantics of the 2+1 view integrated metamodel, which applying the converting rule between class model and Z/Object-Z. The accuracy of the Z specification for the metamodel is verified using Z/Eves tool, which can check the syntax, type, and domain of the Z specification. The transformation specification and checking of the 2+1 view integrated metamodel can help establish more accurate the syntactic semantics of its construct and check the accuracy of the metamodel.

Formal Semantics of Relational Algebra/Calculus for Spatiotemporal Operator in Spatiotemporal Data Model (시공간 데이터 모델에서 시공간 연산자의 관계 수식적 정형의미)

  • Jo, Yeong-So;Kim, Dong-Ho;Ryu, Geun-Ho
    • The Transactions of the Korea Information Processing Society
    • /
    • v.6 no.1
    • /
    • pp.11-20
    • /
    • 1999
  • Because conventional spatial databases process the spatial information that is valid at current time, it is difficult to manage historical information efficiently which has been changed from the past to current. Recently, there are rapid increasing of interest to solve this problem so that makes databases to support historical information as well as spatial management at the same time. It can be eventually used in a various application areas. The formal semantics in a database is used to represent database structures and operations in order to prove the correctiveness of them in terms or mathematics. It also plays an important role in database to design a database and database management system. So in this paper, we suggest spatiotemporal domain, object, data, and spatiotemporal geometric/topological operations. And we not only formalize relational algebra/calculus using formal semantics for a spatiotemporal data model, but also show the example of real orld with them.

  • PDF

Defining Semantics of Live Sequence Chart Specification (Live Sequence Chart 명세언어의 의미론적 정의)

  • Lee, Eun-Young
    • Journal of the Korea Society of Computer and Information
    • /
    • v.11 no.6 s.44
    • /
    • pp.49-57
    • /
    • 2006
  • While developing a complex reactive software system. it is very important to analyze the user requirement and reflect it to the developed system. Therefore understanding the need of users precisely and promptly is the key to the successful software system development. Among several requirement specification languages, message sequence charts (MSCs), also known as sequence diagrams in UML are the most widely used scenario notation. Live Sequence Charts (LSCs) are a variant ot MSCs, characterized by its message abstraction facility and the modality of scenarios. In this paper, I define the formal semantics of LSC specification including the essential language constructs such as pre-charts, variables, assignment and conditions. The range of the formalized LSC language has been broadened, and the scope of the formalized semantics is much closer to the complete LSC specification.

  • PDF

Embedded Distributivity

  • Joh, Yoon-Kyoung
    • Language and Information
    • /
    • v.14 no.2
    • /
    • pp.17-32
    • /
    • 2010
  • Distributivity has been one of the central topics in formal semantics. However, no due attention has been paid to embedded distributivity that very frequently occurs in natural languages. In this paper, I propose a formal analysis for embedded distributivity. In analyzing embedded distributivity, I employ no complicated mechanisms but pluralization. Since distributivity is reduced to plurality as Landman (2000) argues, employing plural formation is not an ad hoc approach to embedded distributivity. That is, the plural variable inserted in the process of deriving embedded distributivity is motivated in a principled manner since the pluralization occurs inside a pluralization operator. Moreover, I point out that the plural variable made available is not restricted to entities.

  • PDF

Definition of Step Semantics for Hierarchical State Machine based on Flattening (평탄화를 이용한 계층형 상태 기계의 단계 의미 정의)

  • Park, Sa-Choun;Kwon, Gi-Hwon;Ha, Soon-Hoi
    • The KIPS Transactions:PartD
    • /
    • v.12D no.6 s.102
    • /
    • pp.863-868
    • /
    • 2005
  • Hardware and software codesign framework called PeaCE(Ptolemy extension as a Codesign Environment) was developed. It allows to express both data flow and control flow which is described as fFSM which extends traditional finite state machine. While the fFSM model provides lots of syntactic constructs for describing control flow, it has a lack of their formality and then difficulties in verifying the specification. In order to define the formal semantics of the fFSM, in this paper, firstly the hierarchical structure in the model is flattened and then the step semantics is defined. As a result, some important bugs such as race condition, ambiguous transition, and circulartransition can be formally detected in the model.

Workflow System Modeling using Activity Diagram (액티비티 다이어그램을 이용한 워크플로우 시스템 모델링)

  • Ko Eun-Jung;Lee Sang-Young;Yoo Cheol-Jung;Jang Ok-Bae
    • Journal of KIISE:Software and Applications
    • /
    • v.32 no.6
    • /
    • pp.473-485
    • /
    • 2005
  • UML activity diagram is useful to model business process and workflow by reason of its suitability to present dynamic aspect of system. However it Is difficult to present precise semantics which is taken as important in workflow system with the guide provided by OMG to the UML activity diagram. This paper suggests workfolw system modelling methodology by applying ASM semantics to the activity diagram after extending its semantics to correspond to workflow system characteristics. Through the exact definition to formal semactics based on ASM it is possible to effectively model workflow.

VOQL* : A Visual Object Query Language with Inductively-Defined Formal Semantics (VOQL* : 귀납적으로 정의된 형식 시맨틱을 지닌 시각 객체 질의어)

  • Lee, Suk-Kyoon
    • Journal of KIISE:Databases
    • /
    • v.27 no.2
    • /
    • pp.151-164
    • /
    • 2000
  • The Visual Object Query Language (VOQL) recently proposed for object databases has been successful in visualizing path expressions and set-related conditions, and providing formal semantics. However, VOQL has several problems. Due to unrealistic assumptions, only set-related conditions can be represented in VOQL. Due to the lack of explicit language construct for the notion of variables, queries are often awkard and less intuitive. In this paper, we propose VOQL*, which extends VOQL to remove these drawbacks. We introduce the notion of visual variables and refine the syntax and semantics of VOQL based on visual variables. We carefully design the language constructs of VOQL* to reflect the syntax of OOPC, so that the constructs such as visual variables, visual elements, VOQL* simple terms, VOQL* structured terms, VOQL* basic formulas, VOQL* formulas, and VOQL* query expressions are hierarchically and inductively constructed as those of OOPC. Most important, we formally define the semantics of each language construct of VOQL* by induction using OOPC. Because of the well-defined syntax and semantics, queries in VOQL* are clear, concise, and intuitive. We also provide an effective procedure to translate queries in VOQL* into those in OOPC. We believe that VOQL* is the first visual query language with the well-defined syntax reflecting the syntactic structure of logic and semantics formally defined by induction.

  • PDF

Automatic Translations for Model Checking of LD Programs (LD 프로그램의 모델 체킹을 위한 자동변환)

  • Kwon, Min-Hyuk;Shin, Seung-Cheol
    • Journal of KIISE:Computing Practices and Letters
    • /
    • v.16 no.2
    • /
    • pp.201-206
    • /
    • 2010
  • PLCs are special purpose microcontrollers used in most automatic control systems such as plants, embedded systems, and intelligent buildings. LD is one of the most popular languages among PLC languages. For now LD programs are mainly verified by simulation and testing which has a lot of limitation. This paper describes how to translate a given LD program into an input of a model checker so that LD program is verified by model checking. We define formal semantics of LD programs and SMV models and specify a formal definition of the translation function which preserves semantics between LD programs and SMV models.