Fusion of possibilistic knowledge bases from a postulate point of view

This paper proposes a postulate-based analysis of the fusion of possibilistic logic bases which are made of pieces of information expressing knowledge associated with certainty degrees. We propose two main sets of postulates: one only focuses on plausible conclusions, while the other considers both plausible conclusions and the certainty degrees associated with them. For each rational postulate, the class of operators that it satisfies is identified. The existence of weights associated with the pieces of information considerably enriches the postulates-based analysis, and leads to a refined classification of combination operators.

[1]  Dov M. Gabbay,et al.  Handbook of defeasible reasoning and uncertainty management systems: volume 2: reasoning with actual and potential contradictions , 1998 .

[2]  Paolo Bison,et al.  A possibilistic approach to sensor fusion in mobile robotics , 1997, Proceedings Second EUROMICRO Workshop on Advanced Mobile Robots.

[3]  H. Prade,et al.  Possibilistic logic , 1994 .

[4]  Sébastien Konieczny,et al.  On the Logic of Merging , 1998, KR.

[5]  Jinxin Lin,et al.  Integration of Weighted Knowledge Bases , 1996, Artif. Intell..

[6]  J. Lang.  Possibilistic Logic: Complexity and Algorithms , 2000 .

[7]  Peter Z. Revesz,et al.  On the Semantics of Arbitration , 1997, Int. J. Algebra Comput..

[8]  Didier Dubois,et al.  Encoding Information Fusion in Possibilistic Logic: A General Framework for Rational Syntactic Merging , 2000, ECAI.

[9]  Hirofumi Katsuno,et al.  On the Difference between Updating a Knowledge Base and Revising It , 1991, KR.

[10]  Marco Schaerf,et al.  Arbitration: A Commutative Operator for Belief Revision , 1995, WOCFAI.

[11]  Dov M. Gabbay,et al.  Handbook of logic in artificial intelligence and logic programming (vol. 1) , 1993 .

[12]  Jérôme Lang,et al.  Logical representation of preferences for group decision making , 2000, KR.

[13]  Peter Gärdenfors,et al.  On the logic of theory change: Partial meet contraction and revision functions , 1985, Journal of Symbolic Logic.

[14]  Henri Prade,et al.  A principled analysis of merging operations in possibilistic logic , 2000, UAI.

[15]  Alberto O. Mendelzon,et al.  Merging Databases Under Constraints , 1998, Int. J. Cooperative Inf. Syst..

[16]  Peter Z. Revesz.  On the semantics of theory change: arbitration between old and new information , 1993, PODS '93.

[17]  Mukesh Dalal,et al.  Investigations into a Theory of Knowledge Base Revision , 1988, AAAI.

[18]  Sébastien Konieczny,et al.  Merging with Integrity Constraints , 1999, ESCQARU.