Skip to main content

Interval-Based Possibilistic Networks

  • Conference paper
Scalable Uncertainty Management (SUM 2014)

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

Included in the following conference series:

Abstract

In this paper, we study foundations of interval-based possibilistic networks where possibility degrees associated with nodes are no longer singletons but sub-intervals of [0,1]. This extension allows to compactly encode and reason with epistemic uncertainty and imprecise beliefs as well as with multiple expert knowledge. We propose a natural semantics based on compatible possibilistic networks. The last part of the paper shows that computing the uncertainty bounds of any event can be computed in interval-based networks without extra computational cost with respect to standard possibilistic networks.

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. Ben Amor, N., Benferhat, S., Mellouli, K.: A two-steps algorithm for min-based possibilistic causal networks. In: Benferhat, S., Besnard, P. (eds.) ECSQARU 2001. LNCS (LNAI), vol. 2143, pp. 266–277. Springer, Heidelberg (2001)

    Chapter  Google Scholar 

  2. Benferhat, S., Hué, J., Lagrue, S., Rossit, J.: Interval-based possibilistic logic. In: Proceedings of the 22nd International Joint Conference on Artificial Intelligence, Barcelona, Catalonia, Spain, July 16-22, pp. 750–755 (2011)

    Google Scholar 

  3. Benferhat, S., Kaci, S.: Logical representation and fusion of prioritized information based on guaranteed possibility measures: application to the distance-based merging of classical bases. Artif. Intell. 148, 291–333 (2003)

    Article  MATH  MathSciNet  Google Scholar 

  4. Benferhat, S., Tabia, K.: Three-valued possibilistic networks. In: 20th European Conference on Artificial Intelligence, Montpellier, France, August 27-31, pp. 157–162. IOS Press (2012)

    Google Scholar 

  5. Kruse, R., Borgelt, C., Gebhardt, J.: Possibilistic graphical models. In: International School for the Synthesis of Expert Knowledge (ISSEK 1998), Udine (Italy), pp. 51–68 (1998)

    Google Scholar 

  6. Cozman, F.G.: Credal networks. Artif. Intell. 120(2), 199–233 (2000)

    Article  MATH  MathSciNet  Google Scholar 

  7. Darwiche, A.: Modeling and Reasoning with Bayesian Networks. Cambridge University Press (2009)

    Google Scholar 

  8. de Campos, C.P.: New complexity results for map in bayesian networks. In: Proceedings of the 22nd International Joint Conference on Artificial Intelligence, IJCAI 2011, Barcelona, Catalonia, Spain, July 16-22, pp. 2100–2106 (2011)

    Google Scholar 

  9. de Campos, C.P., Cozman, F.G.: The inferential complexity of bayesian and credal networks. In: IJCAI 2005, Proceedings of the Nineteenth International Joint Conference on Artificial Intelligence, Edinburgh, Scotland, UK, July 30-August 5, pp. 1313–1318 (2005)

    Google Scholar 

  10. de Campos, L., Huete, J., Moral, S.: Uncertainty management using probability intervals. In: Bouchon-Meunier, B., Yager, R.R., Zadeh, L.A. (eds.) IPMU 1994. LNCS, vol. 945, pp. 190–199. Springer, Heidelberg (1995)

    Chapter  Google Scholar 

  11. Dubois, D., Hájek, P., Prade, H.: Knowledge-driven versus data-driven logics. J. of Logic, Lang. and Inf. 9, 65–89 (2000)

    Article  MATH  Google Scholar 

  12. Dubois, D., Lang, J., Prade, H.: Timed possibilistic logic. Fundam. Inf. 15, 211–234 (1991)

    MATH  MathSciNet  Google Scholar 

  13. Guo, P., Tanaka, H.: Decision making with interval probabilities. European Journal of Operational Research 203(2), 444–454 (2010)

    Article  MATH  MathSciNet  Google Scholar 

  14. Ha, V.A., Doan, A., Vu, V.H., Haddawy, P.: Geometric foundations for interval-based probabilities. Annals of Mathematics and Artificial Intelligence 24, 1–21 (1998)

    Article  MATH  MathSciNet  Google Scholar 

  15. Hisdal, E.: Conditional possibilities independence and non interaction. Fuzzy Sets and Systems, 283–297 (1978)

    Google Scholar 

  16. Jensen, F.V.: An Introduction to Bayesian Networks. UCL Press, London (1996)

    Google Scholar 

  17. Shafer, G.: A Mathematical Theory of Evidence. Princeton University Press, Princeton (1976)

    MATH  Google Scholar 

  18. Walley, P.: Statistical reasoning with imprecise probabilities (1991)

    Google Scholar 

  19. Zadeh, L.: Fuzzy sets as a basis for a theory of possibility. Fuzzy Sets and Systems 100(suppl. 1), 9–34 (1999)

    Article  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2014 Springer International Publishing Switzerland

About this paper

Cite this paper

Benferhat, S., Lagrue, S., Tabia, K. (2014). Interval-Based Possibilistic Networks. In: Straccia, U., Calì, A. (eds) Scalable Uncertainty Management. SUM 2014. Lecture Notes in Computer Science(), vol 8720. Springer, Cham. https://doi.org/10.1007/978-3-319-11508-5_4

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-11508-5_4

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-11507-8

  • Online ISBN: 978-3-319-11508-5

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics