• Journal of KIISE:Databases
• /
• v.33 no.2
• /
• pp.151-162
• /
• 2006

RDF Semantics, one of W3C Recommendations, provides the RDFS entailment rules, which are used for the RDFS inference. Sesame, which is well known RDF repository, supports the RDBMS-based RDFS inference using the forward-chaining strategy. Since inferencing in the forward-chaining strategy is performed in the data loading time, the data loading time in Sesame is slow down be inferencing. In this paper, we propose the order scheme for applying the RDFS entailment rules to improve inference performance. The proposed application order makes the inference process terminate without repetition of the process for most cases and guarantees the completeness of inference result. Also the application order helps to reduce redundant results during the inference by predicting the results which were made already by previously applied rules. In this paper, we show that our approaches can improve the inference performance with comparisons to the original Sesame using several real-life RDF datasets.

• Korean Journal of Logic
• /
• v.6 no.1
• /
• pp.19-32
• /
• 2003

In this paper we investigate the relevance logic E-R of the Entailment E without the reductio (R), and its extensions Ee-R, Eec-R: Ee-R is the E-R with the expansion (e) and Eec-R the Ee-R with the chain (c). We give completeness for each E-R, Ee-R, and Eec-R by using Routley-Meyer semantics.

• Journal of KIISE:Computing Practices and Letters
• /
• v.15 no.2
• /
• pp.125-133
• /
• 2009

RDF is widely used as the ontology language for representing metadata on the semantic web. Since ontology models the real-world, ontology changes overtime. Thus, it is very important to detect and analyze changes in knowledge base system. Earlier studies on detecting changes between RDF models focused on the structural differences. Some techniques which reduce the size of the delta by considering the RDFS entailment rules have been introduced. However, inferencing with RDF models increases data size and upload time. In this paper, we propose a new change detection using RDF reasoning that only computes a small part of the implied triples using backward chaining strategy. We show that our approach efficiently detects changes through experiments with real-life RDF datasets.

• Korean Journal of English Language and Linguistics
• /
• v.2 no.4
• /
• pp.495-518
• /
• 2002

This paper is to analyze various phenomena of NPIs based on Nonveridicality Theory. For this purpose, I present the previous studies concerning NPls and examine their problems: Ladusaw's(1980) Downward Entailment and Zwarts'(1993) Monotonicity Theory. To solve their problems I suggest Giannakidou's(1998, 1999, 2000) Nonveridicality Theory. To conclude, this paper clarifies the reason why NPls are licensed and resolves the problems of previous studies. I explain NPIs' phenomena in questions, modals, intentional verbs, before, perhaps and so on. I analyse the examples of NPls in BNC, S&S, P&P to prove my claim.

• Language and Information
• /
• v.2 no.2
• /
• pp.81-120
• /
• 1998

The case marking phenomenon in Korean is closely related to semantic entailment and should be studied as an interface between syntax and semantics. Assuming a direct mapping between syntactic realization and semantic information, this study investigates the role of the accusative marker ul/lul in Korean, and explores the semantic constraints working on the argument realization on the basis of proto-roles hypothesis. Specifically, I will study various types of case alternations in Korean and clarify the role of the accusative marker ul/lul, which manifests the distinction between direct object NPs and oblique NPs.

• Journal of Korea Multimedia Society
• /
• v.21 no.2
• /
• pp.158-165
• /
• 2018

Since a large amount of multimedia image has dramatically increased, it is important to search semantically relevant image. Thus, several semantic image annotation methods using RDF(Resource Description Framework) model in mobile environment are introduced. Earlier studies on annotating image semantically focused on both the image tag and the context-aware information such as temporal and spatial data. However, in order to fully express their semantics of image, we need more annotations which are described in RDF model. In this paper, we propose an annotation method inferencing with RDFS entailment rules and user defined rules. Our approach implemented in Moment system shows that it can more fully represent the semantics of image with more annotation triples.

• Language and Information
• /
• v.13 no.2
• /
• pp.47-57
• /
• 2009

It has been observed that not all negative polarity items (NPIs) are licensed in the same negative contexts, and different NPIs may be licensed by different negative expressions. This shows that Ladusaw's (1979) downward entailment is not precise enough to account for the distributional patterns of NPIs (van der Wouden, 1997; van der Wouden and Zwarts, 1993; Zwarts, 1986, among others). One well-known attempt to deal with this issue is to divide negative expressions into several subtypes. Using boolean semantics, Zwarts (1986; 1998) distinguishes three kinds of downward entailing licensors and accounts for heterogeneous NPI-licensing conditions by means of the semantic strength of negative expressions. This approach has been adopted to define Korean negation (Nam, 1994; Chung, 1993; Chung, 1997; Hwang, 2009). In this paper, however, we argue that the boolean semantic approach for negation is not adequate in characterizing the properties of Korean negative expressions and explaining the contexts of licensing Korean NPIs.

• Annual Conference on Human and Language Technology
• /
• 2020.10a
• /
• pp.292-297
• /
• 2020

자연어 추론 모델은 전제와 가설 사이의 의미 관계를 함의와 모순, 중립 세 가지로 판별한다. 영어에서는 RTE(recognizing textual entailment) 데이터셋과 다양한 NLI(Natural Language Inference) 데이터셋이 이러한 모델을 개발하고 평가하기 위한 벤치마크로 공개되어 있다. 본 연구는 국외의 텍스트 추론 데이터 주석 가이드라인 및 함의 데이터를 언어학적으로 분석한 결과와 함의 및 모순 관계에 대한 의미론적 연구의 토대 위에서 한국어 자연어 추론 벤치마크 데이터 구축 방법론을 탐구한다. 함의 및 모순 관계를 주석하기 위하여 각각의 의미 관계와 관련된 언어 현상을 정의하고 가설을 생성하는 방안에 대하여 제시하며 이를 바탕으로 실제 구축될 데이터의 형식과 주석 프로세스에 대해서도 논의한다.

• Proceedings of the Korea Contents Association Conference
• /
• 2009.05a
• /
• pp.74-78
• /
• 2009

Efficient reasoning has become important for improving the performance of ontology systems as the size of ontology grows. In this paper, we introduce a method that efficiently performs reasoning of RDFS entailment rules (i.e., rdfs7 and rdfs9 rules) and OWL inverse rule using views in the DBMS-based triple sotre. Reasoning is performed by replacing reasoning rules with the corresponding view definition and storing RDF triples into the structured triple tables. When processing queries, the views is referred instead of original tables. In this way, we can reduce the time needed for reasoning and also obtain the space-efficiency of the triple store.

• The KIPS Transactions:PartB
• /
• v.19B no.2
• /
• pp.135-148
• /
• 2012

This paper proposes a model for recognizing sentential paraphrases through Predicate-Argument Tuple (PAT)-based approximate alignment between two texts. We cast the paraphrase recognition problem as a binary classification by defining and applying various alignment features which could effectively express the semantic relatedness between two sentences. Experiment confirmed the potential of our approach and error analysis revealed various paraphrase patterns not being solved by our system, which can help us devise methods for further performance improvement.