Abstract
A negotiation model consists of two functions: a negotiation function and a weakening function. A negotiation function is defined to choose the weakest sources and these sources will weaken their point of view using a weakening function. However, the currently available belief negotiation models are based on classical logic, which make it difficult to define weakening functions. In this paper, we define a prioritized belief negotiation model in the framework of possibilistic logic. The priority between formulae provides us with important information to decide which beliefs should be discarded. The problem of merging uncertain information from different sources is then solved by two steps. First, beliefs in the original knowledge bases will be weakened to resolve inconsistencies among them. This step is based on a prioritized belief negotiation model. Second, the knowledge bases obtained by the first step are combined using a conjunctive operator or a reinforcement operator in possbilistic logic.
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
Benferhat, S., Dubois, D., Prade, H.: From semantic to syntactic approaches to information combination in possibilistic logic. In: Bouchon-Meunier, B. (ed.) Aggregation and Fusion of Imperfect Information, pp. 141–151. Physica-Verlag, Heidelberg
Benferhat, S., Dubois, D., Prade, H., Williams, M.A.: A Practical Approach to Fusing Prioritized Knowledge Bases. In: Proc. of 9th Portuguese Conf. on Artificial Intelligence, pp. 223–236 (1999)
Benferhat, S., Dubois, D., Prade, H.: Some syntactic approaches to the handling of inconsistent knowledge bases: A comparative study. Part 2: The prioritized case. In: Logic at work: essays dedicated to the memory of Helena Rasiowa / Ewa Orlowska, pp. 473–511. Physica-Verlag, New York (1998)
Benferhat, S., Dubois, D., Kaci, S., Prade, H.: Possibilistic merging and distance-based fusion of propositional information. Annals of Mathematics and Artificial Intelligence 34, 217–252 (2002)
Benferhat, S., Garcia, L.: Handling locally stratified inconsistent knowledge bases. Studia Logica 70, 77–104 (2002)
Booth, R.: A Negotiation-style Framework for Non-prioritized Revision. In: Proc. of TARK 2001, pp. 137–150 (2001)
Booth, R.: Social Contraction and Belief Negotiation. In: Proc. of KR 2002, pp. 374–384 (2002)
Dalal, M.: Investigations into a theory of knowledge base revision: preliminary report. In: Proc. of AAAI 1988, pp. 475–479 (1988)
Dubois, D., Lang, J., Prade, H.: Possibilistic logic. In: Handbook of logic in Aritificial Intelligence and Logic Programming, vol. 3, pp. 439–513. Oxford University Press, Oxford (1994)
Dubois, D., Konieczny, S., Prade, H.: Quasi-possibilistic logic and its measures of information and conflict. Fundamenta Informaticae 57(2-4), 101–125 (2003)
Gärdenfors, P.: Knowledge in Flux-Modeling the Dynamic of Epistemic States. MIT Press, Mass (1988)
Konieczny, S.: Belief base merging as a game. Journal of Applied Non-Classical Logics 14(3), 275–294 (2004)
Lin, J., Mendelzon, A.: Merging databases under constraints. International Journal of Cooperative information Systems 7(1), 55–76 (1998)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Qi, G., Liu, W., Bell, D.A. (2005). Combining Multiple Knowledge Bases by Negotiation: A Possibilistic Approach. In: Godo, L. (eds) Symbolic and Quantitative Approaches to Reasoning with Uncertainty. ECSQARU 2005. Lecture Notes in Computer Science(), vol 3571. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11518655_43
Download citation
DOI: https://doi.org/10.1007/11518655_43
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-27326-4
Online ISBN: 978-3-540-31888-0
eBook Packages: Computer ScienceComputer Science (R0)