Hunter, A; Liu, WR; (2009) Knowledge Base Stratification and Merging Based on Degree of Support. In: Sossai, C and Chemello, G, (eds.) SYMBOLIC AND QUANTITATIVE APPROACHES TO REASONING WITH UNCERTAINTY, PROCEEDINGS. (pp. 383 - 395). SPRINGER-VERLAG BERLIN
Full text not available from this repository.
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 ill 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.
|Title:||Knowledge Base Stratification and Merging Based on Degree of Support|
|Event:||10th European Conference on Symbolic and Quantitative Approaches to Reasoning with Uncertainty|
|Dates:||2009-07-01 - 2009-07-03|
|UCL classification:||UCL > School of BEAMS > Faculty of Engineering Science > Computer Science|
Archive Staff Only: edit this record