Generation of Candidates for Rosolving Inconsistency among Multiple Subsumption Relations

1 Citations 9 References

Bibliographic Information

Other Title
  • 複数の包摂関係の矛盾解消のための候補解の生成と環境

Search this article

Description

Subsumption relation play an important role not only in knowledge information processing systems but also in knowledge-based database systems such as deductive object-oriented database (DOOD) systems. For applying a DOOD paradigm to distributed applications, it is indispensable to maintain the consistency among multiple subsumption relations. Without loss of generality, a subsumption relation is considered as a lattice to solve its constraints, however, merging multiple lattices results in a pre-ordered set. Conventional algorithms for generating a partially ordered set and a lattice assume strong object identification. In this paper, we describe an algorithm, by which we can get some candidate answers for reducing inconsistencies among subsumption relation by interacting with users. The algorithm is implemented in a DOOD-based mediator system, called QUIK.

Journal

  • IPSJ SIG Notes

    IPSJ SIG Notes 114 129-136, 1998-01-19

    Information Processing Society of Japan (IPSJ)

Citations (1)*help

See more

References(9)*help

See more

Details 詳細情報について

  • CRID
    1572543027082924288
  • NII Article ID
    110002930775
  • NII Book ID
    AN10112482
  • ISSN
    09196072
  • Text Lang
    ja
  • Data Source
    • CiNii Articles

Report a problem

Back to top