• Asia pacific journal of information systems
• /
• v.2 no.2
• /
• pp.85-102
• /
• 1992

A deductive database consists of collection of stored facts and deductive rules. It can answer queries based on logical deduction from the stored facts and general rules. A deductive database has both a declarative meaning(semantics) and a procedural meaning. The declarative semantics of a deductive database provides a definition of the meaning of the program in a manner which is independent of procedural considerations, context-free, and easy to manipulate, exchange and reason about. This paper investigates various declarative semantics of deductive databases, dicusses related computational issues, and suggests another declarative semantics for deductive databases which is more practical than others.

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 1996.04a
• /
• pp.183-186
• /
• 1996

The relational database management systems sometimes require extremely long and complicated queries for a certain retreval. In this case, recursive retirevals are more efficient approach than the usual queries. Many researchers have tried to incorporate semantics in the traditional relational models using artificial intelligence techniques. This new concept becomes a deductive database and sometimes it is also called as a logic programming. However, the designer of a deductive database did not overcome the short of relational database. In this paper, we propose a new way of designing queries for the deductive database. We also provide relations for recursive retrieval in the deductive database. These approaches are applied for the material requirement planning.

• The Transactions of the Korea Information Processing Society
• /
• v.3 no.7
• /
• pp.1680-1686
• /
• 1996

The deterministic update method of intensional predicates in a parallel deductive database that deductive database is distributed in a parallel computer architecture in needed. Using updated data from the deterministic update method, a strategy for parallel evaluation of intensional predicates is required. The paper is concerned with an approach to updating parallel deductive database in which very insertion or deletion can be performed in a deterministic way, and an extended parallel semi-naive evaluation algorithm in a parallel computer architecture. After presenting an approach to updating intensional predicates and strategy for parallel evaluation, its implementation is discussed. A parallel deductive database consists of the set of facts being the extensional database and the set of rules being the intensional database. We assume that these sets are distributed in each processor, research how to update intensional predicates and evaluate using the update method. The parallel architecture for the deductive database consists of a set of processors and a message passing network to interconnect these processors.

• The KIPS Transactions:PartD
• /
• v.9D no.6
• /
• pp.991-998
• /
• 2002

With the advent of XML and database languages armed with the object-oriented concept and deductive logic, the problem of efficient query processing for them has become a major issue. We describe a way of processing semi-structured XML data through an implementation of a Deductive and Object-oriented Database (DOODB) language with the explanation of query processing. We have shown how to convert an XML data model to a DOODB data model. We have then presented an efficient query processing method based on Connection Graph Resolution. We also present a knowledge-based query processing method that uses the homomorphism of objects in the database and the associative rule of substitutions.

• Journal of Intelligence and Information Systems
• /
• v.9 no.1
• /
• pp.251-267
• /
• 2003

In order to satisfy the needs of an intelligent information system, it is necessary to have more intelligent query processing in an object-oriented database. In this paper, we present a method to apply intelligent query processing in object-oriented databases using deductive approach. Using this method, we generate intelligent answers to represent the answer-set abstractly for a given query in object-oriented databases. Our approach consists of few stages: rule representation, rule reformation pre-resolution, and resolution. In rule representation, a set of deductive rules is generated based on an object-oriented database schema. In rule reformation, we eliminate the recursion in rules. In pre-resolution, rule transformation is done to get unique intensional literals. In resolution, we use SLD-resolution to generate intensional answers.

• The KIPS Transactions:PartD
• /
• v.9D no.2
• /
• pp.243-250
• /
• 2002

In order to properly interpret and process or operators in deductive databases including indefinite clauses, we propose to use Lasez′s Strong Model Semantics(LSMS) which is reasonably simple yet powerful enough to support both exclusive and inclusive interpretations. Conventional semantics either fail to support both interpretations or simply too complex. Therefore, in this paper we study advantages and difficulties of representing indefinite information, and as for the solution to difficulties, we show how LSMS can be used to support both inclusive or and exclusive or interpretations. We also investigate and analyze it′s properties and show how it semantically differs from others. We believe that LSMS is the only "reasonably simple" semantics that supports both inclusive and exclusive interpretations.

• The Proceeding of the Korean Institute of Electromagnetic Engineering and Science
• /
• v.4 no.1
• /
• pp.28-37
• /
• 1993

The future Personal Communication Service(PCS) is the total personal information communication service to satisfy the importance of information in a highly information - oriented society. Compared with the conventional communication method, it is necessary to provide considerable intelligence to the commu- nication network in order to implement the PCS which guarantees the mobility of each individual. Consequen- tly, the PCS needs a fast large database system which stores the information of each individual. To achieve this goal, this paper presents the parallel implementation of deductive database systems as a main - memory database system.

• The KIPS Transactions:PartD
• /
• v.9D no.2
• /
• pp.227-234
• /
• 2002

When processing a query in a conventional database systems, a set of facts or tuples are usually returned as an answer. This also applies to object -oriented database where a set of objects is returned. Deductive database systems, however, provide the opportunity to obtain the answer of a query as a set of formulas, thereby reduce the costs to process the query, and represent its "intensional answers" in a more compact way independently of the database state. In this paper, by introducing rules info the object-oriented database systems and integrating the intensional query processing of deductive database systems into talc object-oriented database systems, we make it possible not only to answer incomplete queries which are not able to be answered in conventional object-oriented database systems, but also to express the answer-set abstractly as the names of classes, which provides us better understanding of the answer.

• The KIPS Transactions:PartC
• /
• v.10C no.6
• /
• pp.717-726
• /
• 2003

In this paper, we analyze the associated rule based deductive algorithm which creates the rules automatically for intrusion detection from the vast packet data. Based on the result, we also suggest the deductive algorithm which creates the rules of intrusion pattern fast in order to apply the intrusion detection systems. The deductive algorithm proposed is designed suitable to the concept of clustering which classifies and deletes the large data. This algorithm has direct relation with the method of pattern generation and analyzing module of the intrusion detection system. This can also extend the appication range and increase the detection speed of exiting intrusion detection system as the rule database is constructed for the pattern management of the intrusion detection system. The proposed pattern generation technique of the deductive algorithm is used to the algorithm is used to the algorithm which can be changed by the supporting rate of the data created from the intrusion detection system. Fanally, we analyze the possibility of the speed improvement of the rule generation with the algorithm simulation.

• The Transactions of the Korea Information Processing Society
• /
• v.6 no.11
• /
• pp.2981-2988
• /
• 1999

A deductive database consists of facts being the extensional database and rules being the intensional database. Because of the difficulty of evaluating rules, many parallel evaluation algorithms for rules have been presented. But we have not gotten an acceptable result. This paper proposes a new methodology to evaluate proof-theoretic meaning of the linear recursion rule which contains transitive dependency by using a shared-nothing parallel architecture. As first, we prove that there exists the equivalent expression for a linear recursion rule, design the algorithm for evaluating the linear recursion rule based on the equivalent expression, and finally analyse performance of the proposed algorithm.