• The KIPS Transactions:PartD
• /
• v.9D no.3
• /
• pp.417-426
• /
• 2002

Components are stored in a component repository for later reuse. Effective search and retrieval of desired components in a component repository is a very important issue. It usually takes a lot of time and efforts to gather information about a component, and its availability is essential to implement a repository. Software Component Descriptor proposed in CORBA 3 contains information about a component using an XML vocabulary. In this paper we extend Software Component Descriptor to be useful for the search of a component repository. We use a facet scheme as a search method of a component repository. And our new retrieval method supports queries connected with logical operators such as AND, OR, NOT, which were not supported with existing facet retrieval methods. Also we reduce the search complexity considerably.

• Proceedings of the Korean Society for Language and Information Conference
• /
• 2002.06a
• /
• pp.162-172
• /
• 2002

서수 한정사의 수식을 받는 명사구는 "정확히"의 의미와 "적어도"의 의미를 둘 다 가질 수 있다. Horn(1972)과 Kadmon(1985, 1987, 2001)은 "적어도"의 의미를 의미론적 의미로, "정확히"의 의미를 화용적 의미로 분석하고, Kamp는 그 반대 입장을 취한다. 그러나 서수 한정사의 의미를 그 의미 구조와 무관하게 일률적으로 분석하는 이런 접근 방식은 양쪽 중 어떤 입장을 취하든 다음의 두 사실을 설명할 수 없다 (i) 서술구에 쓰인 서수 한정사는 항상 "정확히"의 의미만을 갖는다. (ii) 초점을 받는 서수 한정사도 항상 "정확히"의 의미만을 갖는다. 이 연구는 초점 구문에 대한 논리-의미적 분석 방법에 근거하여 서수 한정사의 중의성의 의미를 설명한다. 구체적으로, 서수 한정사는 통사적 논항에 나타나든 통사적 서술구에 나타나든 상관없이 의미적으로 동일성의 서술구에 나타나면 항상 "정확히"의 의미만을 갖게 되고 의미적 주부에 나타나면 "적어도"의 의미를 갖게 된다는 사실을 보인다.

• Journal of The Korean Association For Science Education
• /
• v.22 no.4
• /
• pp.696-705
• /
• 2002

The main purpose of this study is to investigate whether the correlational reasoning activities could improve middle school students' correlational reasoning abilities. The subjects were 8th grade students, and the correlational reasoning activities of the CASE(cognitive acceleration through science education) program was intervened to the experimental group(n=111) during science class while usual science instruction was given to the control group(n=55). The correlational reasoning test was administered before and after the intervention. The pre-test results showed that most of subjects performed poorly in correlation problems and no significant differences were found between the two groups. In the post-test, the experimental group showed enhanced performance while the control group did not. Therefore it can be concluded that CASE program activities help the students to improve correlational reasoning ability. However, the proportions of students gave correct response were not so high: 27% for the multiple-choice item and about 6% for the essay-type items.

• Journal of the Korean Society for information Management
• /
• v.24 no.3
• /
• pp.119-147
• /
• 2007

Actually a diffusion of a semantic web application and utilization are situations insufficient extremely. Technology most important in semantic web application is construction of the ontology which contents itself with characteristics of semantic web. Proposed a suitable a method of building web ontology for characteristics or semantic web and web ontology as we compared the existing ontology construction ana ontology construction techniques proposed for web ontology construction, and we analyzed. And modeling old ontology to bases to description logic and the any axiom rule that used an expression way of SWRL, and established inference-based web ontology according to proposed ways. Verified performance of ontology established through ontology inference experiment. Also established an web ontology-based intelligence image retrieval system, to experiment systems for performance evaluation of established web ontology, and present an example of implementation of a semantic web application and utilization. Demonstrated excellence of a semantic web application to be based on ontology through inference experiment of an experiment system.

• Journal of Science Education
• /
• v.43 no.1
• /
• pp.79-93
• /
• 2019

There have been great concerns on induction, deduction, abduction, and hypothetical deductive method as scientific method and logic behind the method. However, as seen from the similar logic structure of abduction and hypothetical deductive method logic, distinction of those four terms could be unclear. This study investigates statements of science instruction textbooks concerning those terms to analyze their meaning as scientific method or in the context of inquiry. For this purpose, related statements are extracted from seven textbooks to investigate the definitions and examples of those terms and relation among these terms by focusing on coherence of usage of the terms and the possibility of clear distinction among the terms. We find that those terms do not have coherent meanings in the textbooks and many statements make it hard to distinguish the meanings of the terms. Finally the origin of the confusion and educational implication is discussed.

• The Journal of Information Technology and Database
• /
• v.5 no.1
• /
• pp.13-37
• /
• 1998

인터넷 등의 컴퓨터 통신 네트워크의 발달로 인하여 분산된 정보자원의 공유를 통한 자원에 대한 재사용성의 필요성이 대두되었다. IRD(Information Resource Dictionary)는 조직 내에서 관련된 모든 정보에 대한 데이터가 논리적으로 중앙화된 정보저장소(repository)이다. IRD 내의 데이터는 다른 데이터를 기술하므로 이른바 메타 데이터라고 하기도 한다. IRD의 사전(dictionary) 요소는 정보자원의 종류, 정보자원의 의미, 정보자원의 논리적 구조, 정보자원의 위치, 그리고 정보자원의 접근방법 등을 기술한다. FIPS ANSI의 IRDS는 이항 관계를 이용하여 무결성 제약조건을 표현하므로 제약조건 규칙의 표현과 일반적인 추론 규칙의 표현이 제한되어 있으며, 다양한 형태의 무결성 제약조건의 표현과 IRD와 관련된 여러 정보의 도출 또는 추론 및 관리에 관한 사항은 IRD 응용 고유의 문제로 간주하여 언급하고 있지 않다. 한편, FIPS IRDS는 사용자가 SQL 및 IRD에 대한 전문적 지식이 없이는 사용자 질의 작성이 어려운 점등에 대한 문제점을 안고 있다. 본 논문은 FIPS IRDS의 기본모델에서 정보자원 표현, 정보자원들간의 관계, 정보자원의 관리 정보 구분을 명확히 하기 위해 정보자원 모델을 정보자원 표현요소와 정보자원 관리요소의 두 부류로 나누어 구분하고, 각 부류에 대한 자격 질의(competency question)를 통하여 유추된 요소들을 FIPS ANSI IRDS 기본 모델의 스키마 기술 레벨과 스키마 레벨에 첨가함으로써 그 기본 모델을 확장한다. 그리고, FIPS ANSI IRDS가 제공하는 IRD 기술과 관리 기능을 그대로 포함하면서 앞에서 문제점으로 지적된 제약조건 표현과 추론규칙 표현을 위하여 확장된 기본 모델을 중심으로 각 레벨의 구성 요소들의 형식적 의미(formal semantics)와 레벨 내 혹은 레벨 구성요소들간의 관계성(relationship), 그리고 제약조건의 표현과 질의 추론 규칙들을 식별하여 FOPL(First Order Predicate Logic)로 표현한다. 또한, 본 논문은 FOPL로 표현된 predicate들과 규칙들을 구현하기 위하여 Prolog로 변환하기 위한 이론적 방법론을 제시하고 정보자원 관리를 위한 기본 함수들과 스키마 진화(schema evolution)를 위한 방법론을 제안한다.

• Journal of the Korea Computer Industry Society
• /
• v.5 no.3
• /
• pp.363-370
• /
• 2004

The FIPA community is developing a range of agent-related standards, of which the centerpiece is an Agent Communication Language (ACL). This language includes a number of communicative acts explicitly intended to support negotiation. In this paper, we consider a multi-agent environment that exchanges the resources for achieving agents' goals, represent agents as computational logic-based formalizations, and describe a simple ACL for negotiation using logic-based agents. In particular, we introduce and compare some communication acts that enable counter-agents to know the reason of request(proposal) or the reason of rejection(refusal).

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.18 no.3
• /
• pp.425-438
• /
• 1993

Due to the producer-consumer dependency of shared variables, the potential parallelism embeded in the logic programming language has not been fully examined. The method proposed in this paper eliminates the dependency of shared variables by introducing number-sequenced variables in expanding an AND-OR proof tree. Basically, the execution of a logic program can be divided into two phases : expanding an AND-OR tree and proving the tree by matching facts with leaf nodes. In the course of the first phase, a set of number-sequenced variables are produced by expanding an AND-OR tree in the breadth-first searching. Based on the information of number-sequence, each of them is verified in the second phase in order to prove the tree. Consequently, the proposed algorithm can explore more parallelism without the dependency of shared variables.

• (The)Study of the Eastern Classic
• /
• no.68
• /
• pp.35-67
• /
• 2017

This paper examines the petition to the king of Doam(陶菴) Leejae(李縡), one of the key figures of 18th century. He wrote a total of 49 he petition to the king, mostly resignation petition to the king. He emphasized the genuine feelings and emphasized the accurate persuasion logic when he was writing a petition to the king. It is not contradictory to these elements, looking at his actual situation he wrote. He wrote the resignation petition to the king three times to resign Daejehak (大提學), he changed his persuasion logic in each of the resignation petition to the king. We can look at the aspect of transforming persuasion logic on the same topic. His resignation petition to the king, for the first time, was particularly well structured in terms of composition, and used a proper accent method. His resignation petition to the king has the beautiful literary art of gomun(古文), such as the expression of the so-called munjongjasoon(文從字順) and the composition of paragraph organically corresponding. The best work of his resignation petition to the king is Maneonso(萬言疏). The contents criticized Yeongjo(英祖)'s tangpyeongchaek(蕩平策) while evaluating Sinimoksa(辛壬獄事). It consists of a total of 5,300 letters. This work repeatedly used the irony, the method of seolui(設疑), and the incremental method to criticize the tangpyeongchaek(蕩平策), and put Yeongjo(英祖)'s position to the corner. This work is an example of other the resignation petition to the king.

• Proceedings of the Korean Society of Computer Information Conference
• /
• 2017.01a
• /
• pp.23-24
• /
• 2017

본 논문은 온톨로지를 분석할 때 사용하는 추론엔진의 대한 연구와 비교를 서술한다. 온톨로지를 분석할 때 메타데이터로 검색하고 이를 바탕으로 데이터를 추론한다. 이러한 온톨로지는 시멘틱 웹에서 중요하며 논리를 바탕으로 추론을 적용하여 데이터를 분석한다. 이러한 추론엔진의 적용 사례는 사물 인터넷, 상황인식, 전문가 시스템 등 다양한 곳에 적용이 가능하다. 추론엔진의 연구와 비교를 통하여 추론 기술에 대한 연구와 조사를 서술한다.