• Proceedings of the Korean Information Science Society Conference
• /
• 2000.10b
• /
• pp.27-29
• /
• 2000

멀티에이전트 시스템(MAS: Multi-Agent System)에서 에이전트들 사이의 목표 충돌은 일반적으로 발생 가능한 상황이고, 어떤 에이전트가 다른 에이전트에 관한 모든 지식을 가진다는 것은 불가능하기 때문에 상대방에 관한 부분적인 지식만을 가진 상황에서 목표 충돌을 해결할 수 있는 협상은 중요하다. 본 논문은 MAS에서 믿음(Belief), 소망(Desire), 의도(Intention)를 에이전트 구조의 핵심 요소로 가정하고 이러한 구조를 가지는 BDI 에이전트를 논리 프로그래밍의 입장에서 표현한다. 또한 서로 다른 목표를 가진 BDI 에이전트들이 서로 협상하여 문제를 해결하는 과정에서 발생하는 에이전트들 상호간의 목표 충돌을 해결하는 방법을 제시하며, 이 방법의 효과성을 검증하기 위하여 JAVA와 PROLOG를 결합시킨 InterPROLOG 프로그래밍 언어로 구현하여 시험한다.

• The KIPS Transactions:PartB
• /
• v.9B no.6
• /
• pp.817-826
• /
• 2002

In Korean dialogue honorification phenomenon may occur, an honorific pronoun may be used, and a subject or an object may be completely omitted when it can be recovered based on context. This paper proposes that in order to process Korean dialogue in which such distinct linguistic phenomena occur and to construct its representation structure we mark and use the following information explicitly, not implicitly : information about dialogue participants, information about the speech act of an utterance, information about the relative order of social status for the people involved in dialogue, and information flow among utterances of dialogue. In addition, this paper presents a method of marking and using such situational information and an appropriate representation structure of Korean dialogue. In this paper we set up Korean dialogue representation structure by modifying and extending DRT (Discourse Representation Theory) and SDRT (Segmented Discourse Representation Theory). Futhermore, this paper shows how to process Korean dialogue computationally and construct its representation structure by using Prolog programming language, and then applies such representation structure to spontaneous Korean dialogue to know its validity.

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 1994.04a
• /
• pp.159-165
• /
• 1994

실세계에서 발생하는 많은 문제들은 주어진 제약조건들을 만족하는 범위내에서 해를 찾는 제약만족문제(CSP)의 개념으로 설명될 수 있으며, 이러한 문제들의 해결을 위해 인공지능 및 OR 분야에서 활발한 연구가 계속 되어왔다. 본 연구는 대표적 논리언어인 prolog에서 유한이산 도메인 및 수치 제약조건의 해결을 위한 제약해결기에 대한 연구이다. 본 연구에서 구현된 제약해결기에서는 포워드체킹(FC)을 사용하여 조합적 문제를 효과적인 도메인 여과를 통해 탐색공간 및 탐색시간을 축소시키며, 또한 최적화 문제의 해결에 있어서도 그 문제에 주어진 목적함수와 FC의 장점을 조화 시킴으로써 최적해를 더욱 효과적으로 발견한다.

• Transactions of the Korean Society of Mechanical Engineers
• /
• v.15 no.6
• /
• pp.2026-2036
• /
• 1991

An expert system is developed which can diagnose the causes and remedies of the failures of power transmission gears. The basic components of the expert system are knowledge base, inference engine, and working memory. The knowledges in knowledge base are classified into the knowledges for determining the failure types and for diagnosis of causes and remedies of the failures. The former is represented hierarchically into the main category of eleven groups by rules and the sub category of twenty four groups by facts, while the later is represented by facts according to the each group of knowledges. In the inference engine some considerations are implemented, i.e., the backward chaining method and depth first search to determine the category of the failures, the meta-knowledges to shorten the search space, the certainty factor to evaluate the reliability of result, and the unification strategy to diagnose the causes and remedies of the failures. The working memory is established to hold the results during inference temporarily. In addition, knowledge acquisition facility, explanation facility, and user interface are included for the usefulness of user. This expert system is written with the PROLOG programming language on IBM-PC compatible computer operated by MS-DOS and be executed alone.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.9 no.4
• /
• pp.816-823
• /
• 2005

Non-Horn logic programs are extended from Horn logic programs to the level of 1st order predicate logic. Even though they are more expressive than Horn logic programs, They are not practically used because we do not have efficient implementations. Currently to execute non-Horn logic programs, we translate them to equivalent Horn logic programs using the proof procedure InH-Prolog and compile the Horn logic programs to WAM(Warren Abstract Machine) instructions. In this paper, we propose EWAM(Extended Warren Machine) that executes non-Horn logic programs more efficiently and a compilation scheme that compiles non-Horn logic programs to the EWAM instruction. We implement an EWAM emulator and a compiler and measured the performance of the EWAM emulator and the compiler and found that they are very efficient.

• Proceedings of the Korean Information Science Society Conference
• /
• 2011.06b
• /
• pp.245-248
• /
• 2011

최근 기업들이 SOA, 웹 서비스, 유틸리티 컴퓨팅, 클라우드 컴퓨팅 등과 같은 서비스 지향적인 컴퓨팅 환경에 관심을 가지면서 SLA(Service Level Agreement) 기반의 자동화된 계약관리를 원하고 있다. 일반적으로 SLA는 종이에 자연언어로 표현되어 있어서 SLA 관리나 SLA 기반의 정보처리의 자동화가 제한된다. 이에 본 논문에서는 문서형 SLA를 실행가능한 언어로 표현하는 방법을 제안한다. 그 방법의 핵심은 SLA 문장을 단문, 중문, 또는 복문 형식으로 재구성하고 각 문장을 술어논리로 표현한 뒤, 이를 Prolog 기반 프로그램으로 변환하여 실행가능한 SLA(Active SLA)를 얻는다는 것이다. 이와 함께 ASLA를 활용한 SLA 기반의 계약관리 업무의 자동화에 대한 구체적인 예도 볼 것이다.

• Proceedings of the KIEE Conference
• /
• 2009.07a
• /
• pp.284_285
• /
• 2009

전력 시스템은 사회와 산업이 발전함에 따라서 거대화되고 복잡해지고 있으며, 따라서 전력시스템을 안정적으로 운용하기 위하여 다양한 첨단기능들이 개발되고 있다. 본 논문에서 제안한 765kV 변전소의 지능형 경보처리 시스템은 중앙감시제어 시스템으로부터 입력되는 방대한 경보들로부터 고장진단에 필요한 보호계전기 및 스위치 동작 정보를 필터링하는 기능을 수행하도록 개발되었다. 시스템으로 부터 필터링된 경보들은 고장진단 시스템을 통하여 사고 발생 시 운영자의 사고 처리 시 신뢰도 증진시키고 수행시간을 단축시킨다. 경보처리 시스템은 실계통에서 운용되고 있는 이중 모선 1.5CB 방식의 765kV급 변전소를 대상으로 하며 인공지능 언어인 PROLOG 언어를 기반으로 개발되었다.

• Journal of the Korean Society for information Management
• /
• v.8 no.2
• /
• pp.3-31
• /
• 1991

A prototype model of intelligent information retrieval system is presented with the definition of intelligent information retrieval. An intelligent information retrieval system for Korean documents was designed, and the system was implemented with Turbo Prolog 2.0 and Turbo Pascal 5.5. The characteristics of the system include natural language interface, user modeling, automatic indexing by case relationship, and multiple retrieval techniques.

• Proceedings of the Korean Society for Language and Information Conference
• /
• 2007.11a
• /
• pp.249-258
• /
• 2007

This paper presents an implementation of a gramar of Dynamic Syntax for Japanese. Dynamic Syntax is a grammar formalism which enables a parser to process a sentence in an incremental fashion, establishing the semantic representation. Currently the application of lexical rules and transition rules in Dynamic Syntax is carried out arbitrarily and this leads to inefficient parsing. This paper provides an algorithm of rule application and partitioned parsing state for efficient parsing with special reference to processing Japanese, which is one of head-final languages. At the present stage the parser is still small but can parse scrambled sentences, relative clause constructions, and embedded clauses. The parser is written in Prolog and this paper shows that the parser can process null arguments in a complex sentence in Japanese.

• Nuclear Engineering and Technology
• /
• v.25 no.2
• /
• pp.193-203
• /
• 1993

A new heuristic method for loading pattern search has been developed to overcome short-comings of the algorithmic approach. To reduce the size of vast solution space, general shuffling rules, a regionwise shuffling method, and a pattern grouping method were introduced. The entropy theory was applied to classify possible loading patterns into groups with similarity between them. The pattern search program was implemented with use of the PROLOG language. A two-group nodal code MEDIUM-2D was used for analysis of power distribution in the core. The above mentioned methodology has been tested to show effectiveness in reducing of solution space down to a few hundred pattern groups. Burnable poison rods were then arranged in each pattern group in accordance with burnable poison distribution rules, which led to further reduction of the solution space to several scores of acceptable pattern groups. The method of maximizing cycle length(MCL) and minimizing power-peaking factor(MPF) were applied to search for specific useful loading patterns from the acceptable pattern groups. Thus, several specific loading patterns that have low power-peaking factor and large cycle length were successfully searched from the selected pattern groups.