Approaches to Constructing a Stratified Merged Knowledge Base

  • Anbu Yue
  • Weiru Liu
  • Anthony Hunter
Part of the Lecture Notes in Computer Science book series (LNCS, volume 4724)


Many merging operators have been proposed to merge either flat or stratified knowledge bases. The result of merging by such an operator is a flat base (or a set of models of the merged base) irrespective of whether the original ones are flat or stratified. The drawback of obtaining a flat merged base is that information about more preferred knowledge (formulae) versus less preferred knowledge is not explicitly represented, and this information can be very useful when deciding which formulae should be retained when there is a conflict. Therefore, it can be more desirable to return a stratified knowledge base as a merged result. A straightforward approach is to deploy the preference relation over possible worlds obtained after merging to reconstruct such a base. However, our study shows that such an approach can produce a poor result, that is, preference relations over possible worlds obtained after merging are not suitable for reconstructing a merged stratified base. Inspired by the Condorcet method in voting systems, we propose an alternative method to stratify a set of possible worlds given a set of stratified bases and take the stratification of possible worlds as the result of merging. Based on this, we provide a family of syntax-based methods and a family of model-based methods to construct a stratified merged knowledge base. In the syntax based methods, the formulae contained in the merged knowledge base are from the original individual knowledge bases. In contrast, in the model based methods, some additional formulae may be introduced into the merged knowledge base and no information in the original knowledge bases is lost. Since the merged result is a stratified knowledge base, the commonly agreed knowledge together with a preference relation over this knowledge can be extracted from the original knowledge bases.


Knowledge Base Preference Relation Priority Level Absolute Position Strict Partial Order 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Baral, C., Kraus, S., Minker, J.: Combining multiple knowledge bases. IEEE Transactions on Knowledge Data Engineering 3, 208–220 (1991)CrossRefGoogle Scholar
  2. 2.
    Benferhat, S., Cayrol, C., Dubois, D., Lang, J., Prade, H.: Inconsistency management and prioritized syntax-based entailment. In: Proc. Of IJCAI 1993, pp. 640–647 (1993)Google Scholar
  3. 3.
    Brewka, G.: A rank based description language for qualitative preferences. In: The 16thEuropean Conference on Artificial Intelligence (ECAI 2004), pp. 303–307 (2004)Google Scholar
  4. 4.
    Delgrande, J.P., Schaub, T.: Consistency-based approaches to merging knowledge bases:preliminary report. In: The 10th International Workshop on Non-Monotonic Reasoning(NMR 2004), pp. 26–133 (2004)Google Scholar
  5. 5.
    Dubois, D., Lang, J., Prade, H.: Possibilistic logic. In: Gabbay, D., Hogger, C.J., Robinson, J.A. (eds.) Handbook of Logic in Artificial Intelligence and Logic Programming, Nomonotonic Reasoning and Uncertain Reasoning, pp. 439–513. Oxford University Press, Oxford (1994)Google Scholar
  6. 6.
    Everaere, P., Konieczny, S., Marquis, P.: On merging strategy-proofness. In: The 9th InternationalConference on Principles of Knowledge Representation and Reasoning (KR 2004), pp. 357–368 (2004)Google Scholar
  7. 7.
    Konieczny, S., Pérez, R.P.: On the logic of merging. In: Proc. of KR 1998, pp. 488–498 (1998)Google Scholar
  8. 8.
    Konieczny, S., Lang, J., Marquis, P.: DA2 merging operators. Artificial Intelligence 157(1-2), 49–79 (2004)MathSciNetCrossRefzbMATHGoogle Scholar
  9. 9.
    Meyer, T.: On the semantics of combination operations. Journal of Applied Non-Classical Logics 11(1-2), 59–84 (2001)MathSciNetCrossRefzbMATHGoogle Scholar
  10. 10.
    Qi, G., Liu, W., Bell, D.A.: Merging stratified knowledge bases under constraints. In: The 21st American National Conference on Artificial Intelligence (AAAI 2006), pp. 281–286 (2006)Google Scholar
  11. 11.
    Spohn, W.: Ordinal conditional functions. a dynamic theory of epistemic states. In: Harper, W., Skyrms, B. (eds.) Causation in Decision, Belief Change, and Statistics, vol. 2, pp. 105–134. Kluwer, Dordrecht (1988)CrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2007

Authors and Affiliations

  • Anbu Yue
    • 1
  • Weiru Liu
    • 1
  • Anthony Hunter
    • 2
  1. 1.School of Electronics, Electrical Engineering and Computer ScienceQueen’s University BelfastBelfastUK
  2. 2.Department of Computer ScienceUniversity College LondonLondonUK

Personalised recommendations