• Journal of Korean Society of Transportation
• /
• v.6 no.1
• /
• pp.33-41
• /
• 1988

The Wisconsin Department of Transportation currently has a Datalog Information System which facilitates the collection of geometric characteristics at every 0.01 mile high way section. The objectives of this study are to develop the plan and profile drawing of a highway section utilizing the Datalog Information system and to develop a methodology of investigating the safety aspects associated with the highway section being considered. For this purpose, two of the highway design elements, the minimum stoping sight distance as well as passing sight distance based on the AASHTO requirements, were applied in this study. A computer program was also developed to facilitate the data processing activity. The results from the computer program and from a manual analysis which adopted the identical methodology used in the computer program were in a good agreement. a few discrepancies between the two results were due to the data collection error and they were believed to be negligible. Using the computerized methodology developed in this study one does not need the plan and profile drawing to investigate the safety of a highway section, which appears to be an essential progress to the Computer Aided design and Draft in highway engineering field.

• Journal of KIISE:Software and Applications
• /
• v.34 no.6
• /
• pp.530-538
• /
• 2007

Most existing deductive engines study for optimization of TBox based on Tableaux algorithm. However, in order to deduce mass-storing ABox in reality, it can't be decided in finite time. Therefore, for the efficiency of the deductive engine, there needs to be reasoning technique optimized for ABox. This paper uses the method that changes OWL-DL based Ontology to the form of Rule like Datalog in order to interlock store device such as RDBMS. Ultimately, it tries to in circumstance of real world. Therefor, using Axiom that OWL holds, it suggests reasoning method that applies rules including datatype.

• Proceedings of the Korean Society of Precision Engineering Conference
• /
• 2007.06a
• /
• pp.779-780
• /
• 2007

• Journal of the Semiconductor & Display Technology
• /
• v.5 no.1 s.14
• /
• pp.5-11
• /
• 2006

One of the most important is to insure that a new circuit design is qualified far release before it is scheduled for manufacturing, test, assembly and delivery. Due to various causes, there happens to be a low yield in the wafer process. Wafer test is a critical process in analyzing the chip characteristics in the EDS(electric die sorting) using analytic tools -wafer map, wafer summary and datalog. In this paper, we propose new analytic map algorithms for DDI chip test data. Using the proposed analytic map algorithms, we expect to improve the yield, quality and analysis time.

• Proceedings of the Korean Information Science Society Conference
• /
• 2006.10b
• /
• pp.346-351
• /
• 2006

시맨틱 웹에 대한 관심이 높아짐과 더불어 관련 기술인 온톨로지와 이를 이용한 추론 기술 역시 이슈가 되고 있다. RacerPro, Pellet 등 지금까지의 전형적인 추론 시스템들은 주로 Tableaux Algorithm 기반의 추론 시스템으로 Tableaux Algorithm의 특성상 대용량 ABox 추론에서 문제점을 나타낸다. 이를 해결하기 위한 연구로는 Tableaux Algorithm 기반의 Instance Store와 Disjunctive Datalog Approach를 사용한 KAON2가 있다. 이러한 추론 기술에 대해서는 많은 연구가 진행되고 있지만 각 추론 시스템들에 대한 평가는 부족하다. 현재 추론 시스템들의 벤치마킹은 대부분 Tableaux Algorithm 기반의 TBox 추론에 대한 것으로 ABox 추론 및 최근 이슈인 대용량 ABox 추론에 대한 평가는 특히 부족하다. 이에 본 논문에서는 각 추론 시스템들의 이론적 배경을 근간으로 지금까지의 전형적 추론엔진들과 최근 이슈에 따른 대용량 ABox 추론을 위한 시스템들을 이론적 비교를 통해 살펴보며, 특히 대용량 ABox 추론를 위한 시스템인 Instance Store와 KAON2를 LUBM을 사용하여 평가함으로 대용량 ABox 추론에 있어 사용자의 요구에 따른 적절한 시스템을 제시한다.

• Proceedings of the Korean Information Science Society Conference
• /
• 2006.10b
• /
• pp.352-356
• /
• 2006

현존하는 추론 엔진들은 대부분 Tableaux 알고리즘 기반의 TBox의 최적화를 위한 연구를 진행하였다. 하지만 현실에서 대용량의 ABox를 추론하기 위한 유한한 시간 내에 결정 가능성을 보장하지 못한다. 따라서 실용성 있는 추론 엔진 효율을 위해서는 대용량 데이터를 가지는 ABox를 위한 최적화된 추론 기법이 필요하다. 본 논문에서는 OWL-DL 기반의 온톨로지(Ontology)를 데이터로그(Datalog)와 같은 규칙(Rule) 형태로 변형하여 관계형 데이터베이스와 같은 저장 시스템과 연동하기 위한 방법을 이용한다. 최종적으로 실세계의 환경에서의 데이터타입 속성(Datatype Property)이 포함된 SHIQ(D) 구성의 실용적인 추론 시스템을 수행하고자 한다. 따라서 OWL이 가지는 공리(Axiom)를 이용하여 데이터타입 속성이 포함된 규칙을 적용한 추론 방법에 대해서 제안하였다.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2019.10a
• /
• pp.729-732
• /
• 2019

데이터로그는 논리형 선언형 프로그래밍 언어로, 특히 재귀적인(recursion) 알고리즘을 표현하기 편리한 언어이다. 대표적인 데이터로그 시스템으로는 CORAL, LogicBlox, XSB, Soufflé가 있다. 본논문에서는 이 네 가지 시스템의 특징을 설명하고, 세 가지 벤치마크, 이행적 폐쇄(Transitive closure), 동세대(same generation), 포인터 분석(pointer analysis)으로 데이터로그 시스템들의 재귀 질의(recursive query) 처리 성능을 비교하였다.

• Journal of KIISE:Software and Applications
• /
• v.34 no.7
• /
• pp.655-666
• /
• 2007

Reasoners using typical Tableaux algorithm such as RacerPro, Pellet have a problem in Tableaux algorithm large ABox reasoning. Researches to solve these Problems are dealt with Instance Store of University of Manchester which uses Tableaux algorithm based reasoner and DBMS and KAON2 of University of Karlsruhe using Disjunctive Datalog approach. An evaluation experiment for present reasoners is the experiment of TBox reasoning in most of Tableaux algorithm based one. The most of benchmarking tests in reasoning systems haven't done with ABox reasoning based Tableaux Algorithm but done with TBox reasoning based Tableaux Algorithm. Especially, rarely reported benchmarking tests in reasoners have been issued nowadays. Therefore, this thesis evaluates systems with theory of each reasoners for large ABox reasoning that becomes issues recently with typical reasoners. The large AoBx reasoning engine will be analyzed using Instance Store and KAON2 of Manchester University for large ABox processing. At the analysing method, LUBM(Lehigh University BenchMark), benchmarking test method, and it's test system will be introduced. In conclusion, I recommend appropriate reasoner in various environment with experiment result and characteristic of algorithm used for each reasoner.

• The KIPS Transactions:PartD
• /
• v.8D no.5
• /
• pp.495-506
• /
• 2001

XML makes it possible for data to be exchanged regradless of the data model in which it is represented or the platform on which it is stored, serving as a standard for data exchange format on the internet. Especially, it is natural to send XML data without DTD on the internet when XML is data-centric. Therefore it is needed to extract relational schema to store XML data efficiently, to optimize queries, and to publish data which have been stored in the relational database in the XML format. In this paper, we proposed a method to generate relational database in the XML documents without DTD and store XML data using upper/lower bound schema extraction technique for semistructured data. In extracting a lower bound schema, we especially show an efficient technique for creating relational schema by using simulation with is more advanced than the datalog method.