Knowledge base stratification and merging based on degree of support

9Citations
Citations of this article
6Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Most operators for merging multiple knowledge bases (where each is a set of formulae) aim to produce a knowledge base as output that best reflects the information available in the input. Whilst these operators have some valuable properties, they do not provide explicit information on the degree to which each formula in the output has been, in some sense, supported by the different knowledge bases in the input. To address this, in this paper, we first define the degree of support that a formula receives from input knowledge bases. We then provide two ways of determining formulae which have the highest degree of support in the current collection of formulae in KBs, each of which gives a preference (or priority) over formulae that can be used to stratify the formulae in the output. We formulate these two preference criteria, and present an algorithm that given a set of knowledge bases as input, generates a stratified knowledge base as output. Following this, we define some merging operators based on the stratified base. Logical properties of these operators are investigated and a criterion for selecting merging operators is introduced. © 2009 Springer Berlin Heidelberg.

Cite

CITATION STYLE

APA

Hunter, A., & Liu, W. (2009). Knowledge base stratification and merging based on degree of support. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5590 LNAI, pp. 383–395). https://doi.org/10.1007/978-3-642-02906-6_34

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free