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.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Baral, C., Kraus, S., Minker, J., Subrahmanian, V.: Combining knowledge bases consisting of first-order theories. Computational Intelligence 8(1), 45–71 (1992)
Benferhat, S., Baida, R.: A stratified first order logic approach for access control. Int. J. of Int. Sys. 19, 817–836 (2004)
Benferhat, S., Cayrol, C., Dubois, D., Lang, J., Prade, H.: Inconsistency management and prioritized syntax-based entailment. In: Proc. of IJCAI 1993, pp. 640–645 (1993)
Benferhat, S., Dubois, D., Prade, H.: Reasoning in inconsistent stratified knowledge bases. In: Proc. of ICMVL 1996, pp. 184–189 (1996)
Benferhat, S., Dubois, D., Lang, J., Prade, H., Saffiotti, A., Smets, Ph.: A General approach for inconsistency handling and merging information in prioritized knowledge bases. In: Proc. of KR 1998, pp. 466–477 (1998)
Benferhat, S., Kaci, S., Berre, D., Williams, M.: Weakening conflicting information for iterated revision and knowledge integration. Art. Int. 153(1-2), 339–371 (2004)
Benferhat, S., Lagrue, S., Rossit, J.: An Egalitarist Fusion of Incommensurable Ranked Belief Bases under Constraints. In: Proc. of AAAI 2007, pp. 367–372 (2007)
Brewka, G.: Preferred subtheories - an extended logical framework for default reasoning. In: Proc. of IJCAI 1989, pp. 1043–1048 (1989)
Brewka, G.: A rank-based description language for qualitative preferences. In: Proc. of ECAI 2004, pp. 303–307 (2004)
Cadoli, M., Donini, F.: A survey on knowledge compilation. AI Communication 10(3-4), 137–150 (1997)
Cholewinski, P.: Stratified default logic. In: Pacholski, L., Tiuryn, J. (eds.) CSL 1994. LNCS, vol. 933, pp. 456–470. Springer, Heidelberg (1995)
Davis, A.: Just Enough Requirements Management: Where Software Development Meets Marketing. Dorset House, New York (2005)
Delgrande, J., Dubois, D., Lang, J.: Iterated revision as prioritized merging. In: Proc. of KR 2006, pp. 201–220 (2006)
Everaere, P., Konieczny, S., Marquis, P.: Quota and Gmin merging operators. In: Proc. of IJCAI 2005, pp. 424–429 (2005)
Gädenfors, P.: Knowledge in Flux-Modeling the Dynamic of Epistemic States. MIT Press, Cambridge (1988)
Goldszmidt, M., Pearl, J.: System Z + : A formalism for reasoning with variable-strength defaults. In: Proc. of AAAI 1991, pp. 399–404 (1991)
Katz, Y., Golbeck, J.: Social Network-based Trust in Prioritized Default Logic. In: Proc. of AAAI 2006 (2006)
Konieczny, S., Lang, J., Marquis, P.: DA 2 operators. Art. Int. 157(1-2), 49–79 (2004)
Konieczny, S.: On the difference between merging knowledge bases and combining them. In: KR 2000, pp. 12–17 (2000)
Konieczny, S., Pino Pérez, R.: On the logic of merging. In: Proc. of KR 1998, pp. 488–498 (1998)
Pearl, J.: System Z: A natural ordering of defaults with tractable applications to default reasoning. In: Proc. of the 3rd Int. Conf. on Theor. Aspects of Reas. about Know., pp. 121–135 (1990)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2009 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Hunter, A., Liu, W. (2009). Knowledge Base Stratification and Merging Based on Degree of Support. In: Sossai, C., Chemello, G. (eds) Symbolic and Quantitative Approaches to Reasoning with Uncertainty. ECSQARU 2009. Lecture Notes in Computer Science(), vol 5590. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-02906-6_34
Download citation
DOI: https://doi.org/10.1007/978-3-642-02906-6_34
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-02905-9
Online ISBN: 978-3-642-02906-6
eBook Packages: Computer ScienceComputer Science (R0)