• Journal of KIISE:Software and Applications
• /
• v.36 no.11
• /
• pp.928-935
• /
• 2009

Ontology schema reasoning is used to maintain consistency of concepts and build concept hierarchy automatically. For the purpose, the search of concepts must be inevitably performed. Ontology schema reasoning performs the test of subsumption relationships of all the concepts delivered in the test set. The result of subsumption tests is determined based on the creation of complete graphs, which seriously weighs with the performance of reasoning. In general, the process of creating complete graph has been known as expressive procedure. This process is essential in improving the leading performance. In this paper, we propose a method enhancing the classification performance by identifying unnecessary subsumption test supported by optimized searching method on subsumption relationship test among concepts. It is achieved by propagating subsumption tests results into other concept.

• Journal of KIISE:Computer Systems and Theory
• /
• v.32 no.9
• /
• pp.475-482
• /
• 2005

String data containing wildcard characters may represent certain patterns in texts. A subsumption relation between two patterns can be defined by a subset relation between sets of strings that match those patterns. Thus, the subsumption relation check is important to determine whether each pattern represents a set of strings without any overlap with another pattern. In this paper, we propose an effective algorithm that can determine subsumption relation between strings with wildcard characters. First, we consider a simple extension of the suffix tree algorithm so that it nay include wildcard characters and then we propose another method that checks the subsumption relation by dividing a suffix tree structure at each location of string data.

• Journal of KIISE:Computing Practices and Letters
• /
• v.14 no.4
• /
• pp.401-411
• /
• 2008

Folksonomy, which is created through the collaborative tagging from many users, is one of the driving factors of Web 2.0. Tags are said to be the web metadata describing a web document. If we are able to find the semantic subsumption relationships between tags created through the collaborative tagging, it can help users understand the metadata more intuitively. In this paper, targeting del.icio.us tag data, we propose a method named FolksoViz for deriving subsumption relationships between tags by using Wikipedia texts. For this purpose, we propose a statistical model for deriving subsumption relationships based on the frequency of each tag on the Wikipedia texts, and TSD(Tag Sense Disambiguation) method for mapping each tag to a corresponding Wikipedia text. The derived subsumption pairs are visualized effectively on the screen. The experiment shows that our proposed algorithm managed to find the correct subsumption pairs with high accuracy.

• Proceedings of the Korean Information Science Society Conference
• /
• 2004.10a
• /
• pp.712-714
• /
• 2004

본 논문에서는 wildcard character를 포함하는 문자열의 집합을 대상으로, 이들 사이의 subsumption 관계를 파악하여 더 구체적인 정보를 가지는 문자열들의 집합을 구하고자 하는 것이다. 이를 위해 기존의 suffix tree 알고리즘이 wildcard character를 포함하는 문자열을 처리할 수 있도록 단순 적용한 방법과 trie의 집합을 이용하여 wildcard character를 포함한 문자열을 처리하는 두 가지 방법을 고려하였다

• 제어로봇시스템학회:학술대회논문집
• /
• 2002.10a
• /
• pp.111.3-111
• /
• 2002

$\textbullet$introduction $\textbullet$CO-evolution Algorithm $\textbullet$Subsumption Architecture $\textbullet$Neural Network $\textbullet$Khepera Robot

• International Journal of Fuzzy Logic and Intelligent Systems
• /
• v.9 no.3
• /
• pp.161-165
• /
• 2009

Increase of multimedia information in Web requires a new method to manage and service multimedia documents efficiently. This paper proposes a conceptual object grouping method by fuzzy filtering, which is automatically constituted based on increase of multimedia documents. The proposed method composes subsumption relations between conceptual objects automatically using fuzzy filtering of the document objects that are extracted from domains. Grouping of such conceptual objects is regarded as subsumption relation which is decided by $\mu$-cut. This paper proposes $\mu$-cut, FAS(Fuzzy Average Similarity) and DSR(Direct Subsumption Relation) to decide fuzzy filtering, which groups related document objects easily. This paper used about 1,000 conceptual objects in the performance test of the proposed method. The simulation result showed that the proposed method had better retrieval performance than those for OGM(Optimistic Genealogy Method) and BGM(Balanced Genealogy Method).

• Asia pacific journal of information systems
• /
• v.7 no.2
• /
• pp.163-183
• /
• 1997

As object models and hybrid knowledge are increasingly used in current information systems development, Is-a structures need to be more formally defined, and subsequently subsumption related anomalies need to be detected with minimal declaration of meta knowledge. This paper extends a metagraph in the hybrid environments and demonstrates its utilities for detecting such anomalies that can occur from semantics and dynamics unique to the hybrid knowledge and data structure.

• Proceedings of the Korean Society for Emotion and Sensibility Conference
• /
• 1999.03a
• /
• pp.133-137
• /
• 1999

테스트의 종적 분할 모델은 적응성, 강건성, 속응성의 관점에서 장점을 갖는다. 그러나 종적 분할 모델을 실제로 구현하기 위해서는 환경에 대한 적자가 시스템 운영을 장악해야 한다는 전제 조건이 충족되어야 한다. Brooks의 Subsumption 모델은 이러한 조건을 충족시키기에 충분하지만 subsumption 제약 자체가 일반적인 도메인에 적용되기에는 지나치게 엄격한 점이 있다. 본 논문에서는 이에 대한 한가지 대안으로 감성 계층을 이용한 방안을 제시한다. 감성 계층을 사용하는 경우 시스템을 구성하는 모듈 상호간에 있어서 보다 단순한 구조와 다양한 효과를 갖는 "관계 설정"이 가능해진다. 본 논문에서는 관계 설정에 대한 일한 유연성이 일반적인 도메인에 대한 종적 분할 모델의 적용 능력을 개선시킬 수 있음을 보인다.수 있음을 보인다.

• ETRI Journal
• /
• v.9 no.1
• /
• pp.84-96
• /
• 1987

The equality relation is very important in mechanical theorem proving procedures. A proposed inference rule called RHU-resolution is intended to extend the hyperparamodulation[23, 9] by introducing a bidirectional proof search that simultaneously employs a forward reasoning and a backward reasoning, and generalize it by incorporating beneflts of extended hyper steps with a preprocessing process, that includes a subsumption check in an equality graph and a high level planning. The forward reasoning in RHU-resolution may replace the role of the function substitution link.[9] That is, RHU-deduction without the function substitution link gets a proof. In order to control explosive generation of positive equalities by the forward reasoning, we haue put some restrictions on input clauses and k-pd links, and also have included a control strategy for a positive-positive linkage, like the set-of-support concept, A linking path between two end terms can be found by simple checking of linked unifiability using the concept of a linked unification. We tried to prevent redundant resolvents from generating by preprocessing using a subsumption check in the subsumption based eauality graph(SPD-Graph)so that the search space for possible RHU-resolution may be reduced.

• Communications of Mathematical Education
• /
• v.24 no.3
• /
• pp.777-792
• /
• 2010

It is to design diverse teaching methods to construct competitive knowledge-based society and to design teaching methods suitable to Korean conditions. The study reviewed Ausubel's meaningful learning especially subsumption theory as a plan to make students understand math and receive it meaningfully through explanatory class. Analyzing meaning and conditions of Ausubel's meaningful learning can make utility of significant explanatory learning in education of mathematics easier.