Skip to main content

Merging Interval-Based Possibilistic Belief Bases

  • Conference paper
Scalable Uncertainty Management (SUM 2012)

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 7520))

Included in the following conference series:

Abstract

In the last decade, several approaches were introduced in literature to merge multiple and potentially conflicting pieces of information. Within the growing field of application favourable to distributed information, data fusion strategies aim at providing a global and consistent point of view over a set of sources which can contradict each other. Moreover, in many situations, the pieces of information provided by these sources are uncertain.

Possibilistic logic is a well-known powerful framework to handle such kind of uncertainty where formulas are associated with real degrees of certainty belonging to [0,1]. Recently, a more flexible representation of uncertain information was proposed, where the weights associated with formulas are in the form of intervals. This interval-based possibilistic logic extends classical possibilistic logic when all intervals are singletons, and this flexibility in representing uncertain information is handled without extra computational costs. In this paper, we propose to extend a well known approach of possibilistic merging to the notion of interval-based possibilistic knowledge bases. We provide a general semantic approach and study its syntactical counterpart. In particular, we show that convenient and intuitive properties of the interval-based possibilistic framework hold when considering the belief merging issue.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Benferhat, S., Dubois, D., Kaci, S., Prade, H.: A principled analysis of merging operations in possibilistic logic. In: Proceedings of Uncertainty in Artificial Intelligence, pp. 24–31 (2000)

    Google Scholar 

  2. Benferhat, S., Dubois, D., Kaci, S., Prade, H.: Possibilistic merging and distance-based fusion of propositional information. Annal of Mathematical Artificial Intelligence 34(1-3), 217–252 (2002)

    Article  MathSciNet  MATH  Google Scholar 

  3. Benferhat, S., Dubois, D., Prade, H., Williams, M.-A.: A Practical Approach to Fusing Prioritized Knowledge Bases. In: Barahona, P., Alferes, J.J. (eds.) EPIA 1999. LNCS (LNAI), vol. 1695, pp. 222–236. Springer, Heidelberg (1999)

    Chapter  Google Scholar 

  4. Benferhat, S., Hué, J., Lagrue, S., Rossit, J.: Interval-based possibilistic logic. In: Proceedings of International Joint Conferences on Artificial Intelligence, pp. 750–755 (2011)

    Google Scholar 

  5. Benferhat, S., Kaci, S.: Fusion of possibilistic knowledge bases from a postulate point of view. International Journal of Approximate Reasoning 33(3), 255–285 (2003)

    Article  MathSciNet  MATH  Google Scholar 

  6. Chemin, M., Rico, A., Prade, H.: Decomposition of Possibilistic Belief Functions into Simple Support Functions. In: Melo-Pinto, P., Couto, P., Serôdio, C., Fodor, J., De Baets, B. (eds.) Eurofuse 2011. AISC, vol. 107, pp. 31–42. Springer, Heidelberg (2011)

    Chapter  Google Scholar 

  7. Destercke, S., Dubois, D., Chojnacki, E.: Possibilistic information fusion using maximal coherent subsets. Transactions on Fuzzy Systems 17(1), 79–92 (2009)

    Article  MathSciNet  Google Scholar 

  8. Dubois, D., Lang, J., Prade, H.: Possibilistic logic. In: Handbook of Logic in Artificial Intelligence and Logic Programming, vol. 3, pp. 439–513 (1994)

    Google Scholar 

  9. Dubois, D., Prade, H.: Generalized Possibilistic Logic. In: Benferhat, S., Grant, J. (eds.) SUM 2011. LNCS, vol. 6929, pp. 428–432. Springer, Heidelberg (2011)

    Chapter  Google Scholar 

  10. Everaere, P., Konieczny, S., Marquis, P.: Disjunctive merging: Quota and gmin merging operators. Artificial Intelligence Journal 174(12-1), 824–849 (2010)

    Article  MathSciNet  MATH  Google Scholar 

  11. Everaere, P., Konieczny, S., Marquis, P.: Compositional belief merging. In: Proceedings of International Conference on Principles of Knowledge Representation and Reasoning (to appear, 2012)

    Google Scholar 

  12. Guilin, Q., Liu, W., Bell, D.A.: Merging stratified knowledge bases under constraints. In: Proceedings of AAAI Conference on Artificial Intelligence, pp. 348–356 (2006)

    Google Scholar 

  13. Konieczny, S., Pino-Pérez, R.: Merging information under constraints: a logical framework. Journal of Logic and Computation 12(5), 773–808 (2002)

    Article  MathSciNet  MATH  Google Scholar 

  14. Lang, J.: Possibilistic logic: complexity and algorithms. In: Handbook of Defeasible Reasoning and Uncertainty Management Systems, vol. 5, pp. 179–220. Kluwer Academic (2000)

    Google Scholar 

  15. Lin, J.: Integration of weighted knowledge bases. Artificial Intelligence 83(2), 363–378 (1996)

    Article  MathSciNet  Google Scholar 

  16. Qi, G., Liu, W., Bell, D.: A Comparison of Merging Operators in Possibilistic Logic. In: Bi, Y., Williams, M.-A. (eds.) KSEM 2010. LNCS, vol. 6291, pp. 39–50. Springer, Heidelberg (2010)

    Chapter  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2012 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Benferhat, S., Hué, J., Lagrue, S., Rossit, J. (2012). Merging Interval-Based Possibilistic Belief Bases. In: Hüllermeier, E., Link, S., Fober, T., Seeger, B. (eds) Scalable Uncertainty Management. SUM 2012. Lecture Notes in Computer Science(), vol 7520. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-33362-0_34

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-33362-0_34

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-33361-3

  • Online ISBN: 978-3-642-33362-0

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics