논리 프로그램의 AND 병렬 수행을 위한 정형적인 제안

학위논문(석사) - 한국과학기술원 : 전산학과, 1990.2, [ [iii], 55 p. ]In this thesis, we treat of AND parallel execution of logic programs, especially, backtracking and resetting. As a means to overcome difficulty in understanding AND parallel execution of logic programs, a formal framework for AND parallel execution is proposed. The proposed framework can give a rather formal view to AND parallel execution of logic programs than that of algorithmic presentation. Based on the proposed formal framework, an intelligent scheme for backtracking and resetting is proposed. For more intelligent backtracking, an analysis, called literal failure analysis, can be applied optionally. The proposed intelligent resetting scheme is based on the binding information of each failed literal, which its a main origin of intelligent resetting. Correctness of the proposed resetting scheme is proved in a simple and formal way. The proposed scheme is simulated with a parallel simulator and experimental results are also given in comparison with other research.한국과학기술원 : 전산학과

컴파일 시간 분석을 이용한 논리 프로그램의 효율적인 상향식 수행

학위논문(박사) - 한국과학기술원 : 전산학과, 1994.2, [ v, 100 p. 삽도 ; ]Bottom-up evaluation of logic programs has recently attracted much attention in the logic programming and the deductive database field due to a number of advantages such as logical completeness and freedom from non-logical features. However, query evaluation by the bottom-up strategy may be inefficient since it may generate many irrelevant facts to a given query. As an approach to overcoming this drawback, the filtering strategy restricts generation of irrelevant facts by filters based on the bottom-up data flow evaluation. This dissertation defines a generalized filtered bottom-up evaluation formally and formalizes the static filter computation algorithm to give a formal view to static filter and its computation. Based on the formalism, the static filter is extended to stratified programs, in which rules may have negative literals, but which allow no recursive negation. The static filter, however, has its limit since it is computed at compile time using only data-independent bindings. In order to overcome the drawback of the static filtering, a new filtered bottom-up evaluation is provided using a new abstract filter which is computed by abstract interpretation at compile time. The general definition of abstract filters is presented on a general abstract domain not confined on a particular abstract domain. As a specialization, an abstract filter is computed using a new two-phase abstract interpretation. The two-phase abstract interpretation consists of a bottom-up phase followed by a top-down one and provides an approximation of success patterns of clauses relevant to a given query. This framework is specialized by considering the depth k abstraction as abstraction function. For other applications, the two-phase analysis is also applied to improving several top-down evaluation models. From the theoretical point of view, the abstract filter is shown to be at least as powerful as the static filter under some assumptions, and is compared with other related works....한국과학기술원 : 전산학과