• Title/Summary/Keyword: Description logic

Search Result 166, Processing Time 0.022 seconds

A Semantic Similarity Decision Using Ontology Model Base On New N-ary Relation Design (새로운 N-ary 관계 디자인 기반의 온톨로지 모델을 이용한 문장의미결정)

  • Kim, Su-Kyoung;Ahn, Kee-Hong;Choi, Ho-Jin
    • Journal of the Korean Society for information Management
    • /
    • v.25 no.4
    • /
    • pp.43-66
    • /
    • 2008
  • Currently be proceeded a lot of researchers for 'user information demand description' for interface of an information retrieval system or Web search engines, but user information demand description for a natural language form is a difficult situation. These reasons are as they cannot provide the semantic similarity that an information retrieval model can be completely satisfied with variety regarding an information demand expression and semantic relevance for user information description. Therefore, this study using the description logic that is a knowledge representation base of OWL and a vector model-based weight between concept, and to be able to satisfy variety regarding an information demand expression and semantic relevance proposes a decision way for perfect assistances of user information demand description. The experiment results by proposed method, semantic similarity of a polyseme and a synonym showed with excellent performance in decision.

Term-Based Scheduling Languages and their Comparison in View or the Expressivity

  • Kim, Pok-Son;Arne Kutzner;Park, Taehoon
    • Proceedings of the Korean Institute of Intelligent Systems Conference
    • /
    • 2003.09a
    • /
    • pp.20-23
    • /
    • 2003
  • The logic-based scheduling languages RSV and RCPSV may be used to represent and to solve a new general class of resource-constrained project scheduling with variants. RSV and RCPSV syntactically represent schedul7ing problems as descriptions (activity terms) being similar to concepts in a description logic. Though RSV and RCPSV have a different syntax, they are equal1y expressive. On the other hand, from a complexity point of view RCPSV permits more compact representations than RSV. We argue that the difference may be exponential.

  • PDF

THEORIES OF SET AND LOGIC : COMPUTING WITH WORDS AND NUMBERS

  • Turksen, I.B.
    • Proceedings of the Korean Institute of Intelligent Systems Conference
    • /
    • 1998.06a
    • /
    • pp.1-19
    • /
    • 1998
  • In this Kdynote address, two types of information granules are considered : (ⅰ) one for set assignments of a concept descriptor and (ⅱ) the other for truthood assignment to the concept description verifier. The first is, the process which specifies the assignment of an object to a clump, a class, a group, etc., and hence defines the set membership with a relational constraint. the second is the assignment of the degree of truthood or the membership specification of the abstract concept of truthood which specifies the " veristic" constraint associated with the concept descriptor. The combination of these two distinct assignments let us generate four set and logic theories. This then leads to the concern of normal forms and their derivation from truth tables for each of these theories. In this regard, some of the fundamental issues arising in this context are discussed and certain preliminary answers are provided in order to highlight the consequences of these theories.

  • PDF

COMPLEXITY OF THE SCHEDULING LANGUAGE RSV

  • KIM POK-SON;KUTZNER ARNE;PARK TAEHOON
    • Journal of applied mathematics & informatics
    • /
    • v.20 no.1_2
    • /
    • pp.181-195
    • /
    • 2006
  • Resource-constrained project scheduling problems with variant processes can be represented and solved using a logic-based terminological language called RSV (resource constrained project scheduling with variant processes). We consider three different variants for formalizing the RSV-scheduling problem, the optimizing variant, the number variant and the decision variant. Using the decision variant we show that the RSV- problem is NP-complete. Further we show that the optimizing variant (or number variant) of the RSV-problem is computable in polynomial time iff. the decision variant is computable in polynomial time.

Semantic Context Management Using DL Reasoning and Temporal Reasoning (DL 추론과 시간적 추론을 적용한 상황 정보 관리)

  • Kim, Je-Min;Park, Young-Tack
    • Proceedings of the Korean Information Science Society Conference
    • /
    • 2006.10b
    • /
    • pp.152-157
    • /
    • 2006
  • 상황 정보 관리 시스템은 외부에서 입력된 상황 정보의 숨겨진 의미를 파악하여 상황인지 에이전트 및 상황인지 브로커가 효과적으로 상황정보를 획득하도록 한다. 본 논문에서는 외부 환경으로부터 받은 상황정보의 숨겨진 의미를 파악하기 위해 DL 추론과 시간적 추론을 적용한 상황 정보 관리 시스템을 제안한다. 이를 위해서 3가지 부분에 초점을 두었다. 첫 번째, 외부에서 입력된 상황 정보를 효율적으로 표현하고 여러 에이전트간의 상황 정보 공유가 가능하도록 온톨로지 모델을 적용한다. 온톨로지로 표현된 상황정보는 정보의 속성을 제약함으로써 숨겨진 상황 정보를 추론할 수 있도록 해준다. 두 번째로 상황 정보의 관계를 추론할 수 있도록 서술 논리(Description Logic)를 적용한다. 마지막으로 상황 정보의 시간적 관계를 추론할 수 있도록 시간 논리(Temporal Logic)을 적용한다. 따라서 본 논문에서의 최종 목표는 상황 정보 관리 시스템 연구를 통해 상황인지 에이전트 및 상황인지 브로커에 활용이 가능한 온톨로지 기반 추론 기능을 보유하는 지능형 모듈의 기본 프레임워크를 구축하는 것이다.

  • PDF

Adaptive Fuzzy Logic Control for Sight Stabilization System (조준경 안정화 장치의 적응 퍼지 논리 제어)

  • 소상호;김도종;박동조;변증남
    • Proceedings of the Korean Institute of Intelligent Systems Conference
    • /
    • 1997.11a
    • /
    • pp.63-66
    • /
    • 1997
  • The rule bases self organizing controller(SOC) has one of its main advantages in the fact that there is no need to have a mathematical description of the system to be controlled. In this controller, the rules are linguistics statements expressed mathematically through the concepts of fuzzy sets and correspond to the actions a human operator would take when controlling a given process. With this controller, we have performed to sight stabilization system, and we realize that it needs a scale factor tuning. The self tuning controller(STC) uses an instantaneous system fuzzy performance which can give an inspection to the scale factor. Therefore, the STC can compensate the scale factor when it is not adequately tuned. With this trial, we shows that STC can give a good transient characteristics in the nonlinearity which imposed basically in the conventional servo system.

  • PDF

Simulation Technique for Secure Inter-locking Software (연동소프트웨어의 안정성 확보를 위한 시뮬레이션 기법)

  • 황종규;이종우;오석문;김영훈
    • Proceedings of the KSR Conference
    • /
    • 1999.05a
    • /
    • pp.283-290
    • /
    • 1999
  • Recently, the ${\mu}$-processor based-controlled systems instead of conventional relays circuitry are widely used to industrial applications, and also those technology is available to railway signalings which are safety-critical systems. However, the safety and reliability of software for those systems are harder to demonstrate than in traditional relays circuitry because the faults or errors can not be analyzed and predicted to those systems. So, the safety problems are crucial more and more in ${\mu}$-processor based-controlled system. In this paper, the Grafcet language, the graphical and mathematical form, is used to obtain the high-level safety and reliability of software control logic. The general description for Grafcet notation are provided. And some partial of interlocking logic are formally modeled and simulated by Grafcet language and graphical windows.

  • PDF

Analysis of Interlocking Functions using Gragcet Language (Grafcet을 이용한 연동로직 분석)

  • Hwang, Jong-Gyu;Lee, Jong-Woo;Lee, Jae-Ho;Choi, Gyu-Hyung
    • Proceedings of the KIEE Conference
    • /
    • 1999.07a
    • /
    • pp.471-473
    • /
    • 1999
  • Recently, the computer based control systems instead of conventional relays circuitry are widely used to industrial applications, and also those technology is available to railway signaling which are safety-critical systems. However, the safety and reliability of software for those systems are harder to demonstrate than in traditional relays circuitry because the faults or errors can not be analyzed and predicted to those systems. So, the safety problems are crucial more and more in computer based control system. In this paper, the GRAFCET(GRAphe Fonctionnel do Commande Etape/Transition) language is used as a analysis and verification tool for safety-critical interlocking logic. The general description for Grafcet notation are provided and the general modeling for interlocking logic is presented.

  • PDF

A Multiple-Valued Fuzzy Approximate Analogical-Reasoning System

  • Turksen, I.B.;Guo, L.Z.;Smith, K.C.
    • Proceedings of the Korean Institute of Intelligent Systems Conference
    • /
    • 1993.06a
    • /
    • pp.1274-1276
    • /
    • 1993
  • We have designed a multiple-valued fuzzy Approximate Analogical-Reseaning system (AARS). The system uses a similarity measure of fuzzy sets and a threshold of similarity ST to determine whether a rule should be fired, with a Modification Function inferred from the Similarity Measure to deduce a consequent. Multiple-valued basic fuzzy blocks are used to construct the system. A description of the system is presented to illustrate the operation of the schema. The results of simulations show that the system can perform about 3.5 x 106 inferences per second. Finally, we compare the system with Yamakawa's chip which is based on the Compositional Rule of Inference (CRI) with Mamdani's implication.

  • PDF

Ontology-aware Deduct ive Inference System (온톨로지 연계 연역 추론 시스템의 설계 및 개발)

  • 장민수;손주찬
    • Proceedings of the Korean Information Science Society Conference
    • /
    • 2003.10a
    • /
    • pp.133-135
    • /
    • 2003
  • 시맨틱 웹은 지식을 구조적으로 표현할 수 있는 수단과, 논리를 기반으로 지식을 처리하는 기술을 주요 요소로 포함하고 있다. 후자에 대한 유력한 기술로 기호 논리를 기반으로 한 연역 추론 기법이 폭넓게 응용되고 있으나 아직 초보적인 단계에 머물러 있다. 본 논문은 시맨틱 웹 환경에서 효과적인 추론 기능을 수행할 수 있는 연역 추론 시스템의 설계 및 구현 내용을 담고 있다. 본 논문에서 제시하는 추론 시스템은 표준 기술 논리(Description Logic)의 상당 부분과 혼 논리(Horn Logic) 기반의 논리 프로그래밍을 아우르는 확장된 표현력을 제공하여, RETE 알고리즘 기반의 생성 시스템을 활용하여 추론한다. 또한, 규칙베이스를 구성하는 단위 지식들을 웹 자원화함으로써 온톨로지로 대표되는 시맨틱 웹의 지식 표현력을 확장하였다. 본 논문이 제시하는 추론 시스템을 이용하면 웹 온톨로지 위에 규칙 및 논리 계층[1]을 효과적으로 구현할 수 있다.

  • PDF