Skip to main content

Toward Updating Belief Functions over Belnap-Dunn Logic

  • Conference paper
  • First Online:
Belief Functions: Theory and Applications (BELIEF 2022)

Abstract

[3] and [7] generalize the notion of probability measures and belief functions to Belnap-Dunn (\(\textsf{BD}\)) logic, respectively. This work aims at providing an alternative way to treat contradictory information by relying on a logic that was introduced to reason about incomplete and contradictory information rather than on classical logic. In this article, we study how to update belief functions over \(\textsf{BD}\) logic with new pieces of information. We present a first approach via a frame semantics of \(\textsf{BD}\) logic. This frame semantics relying on sets, we can use Bayesian update and Dempster-Shafer combination rule over powerset algebras to define their corresponding updates within the framework of \(\textsf{BD}\) logic.

The research of Sabine Frittella and Sajad Nazari was funded by the grant ANR JCJC 2019, project PRELAP (ANR-19-CE48-0006).

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 EPUB and 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

Similar content being viewed by others

References

  1. Barthélemy, J.-P.: Monotone functions on finite lattices: an ordinal approach to capacities, belief and necessity functions. In: Fodor, J., De Baets, B., Perny, P. (eds.) Preferences and Decisions Under Incomplete Knowledge, pp. 195–208. Physica Verlag (2000)

    Google Scholar 

  2. Belnap, N.D.: How a computer should think. In: Omori, H., Wansing, H. (eds.) New Essays on Belnap-Dunn Logic. SL, vol. 418, pp. 35–53. Springer, Cham (2019). https://doi.org/10.1007/978-3-030-31136-0_4

    Chapter  Google Scholar 

  3. Bílková, M., Frittella, S., Kozhemiachenko, D., Majer, O., Nazari, S.: Reasoning with belief functions over belnap-dunn logic. Preprint arXiv:2203.01060 (2022)

  4. Frittella, S., Manoorkar, K., Palmigiano, A., Tzimoulis, A., Wijnberg, N.: Toward a Dempster-Shafer theory of concepts. Int. J. Approx. Reason. 125, 14–25 (2020)

    Article  MathSciNet  Google Scholar 

  5. Grabisch, M.: Belief functions on lattices. Int. J. Intell. Syst. 24(1), 76–95 (2009)

    Article  Google Scholar 

  6. Halpern, J.Y.: Reasoning About Uncertainty, 2nd edn. MIT Press, Cambridge (2017)

    Book  Google Scholar 

  7. Klein, D., Majer, O., Rafiee Rad, S.: Probabilities with gaps and gluts. J. Philos. Log. 50(5), 1107–1141 (2021)

    Article  MathSciNet  Google Scholar 

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

    Book  Google Scholar 

  9. Zhou, C.: Belief functions on distributive lattices. Artif. Intell. 201, 1–31 (2013)

    Article  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Sajad Nazari .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2022 The Author(s), under exclusive license to Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Frittella, S., Majer, O., Nazari, S. (2022). Toward Updating Belief Functions over Belnap-Dunn Logic. In: Le Hégarat-Mascle, S., Bloch, I., Aldea, E. (eds) Belief Functions: Theory and Applications. BELIEF 2022. Lecture Notes in Computer Science(), vol 13506. Springer, Cham. https://doi.org/10.1007/978-3-031-17801-6_25

Download citation

  • DOI: https://doi.org/10.1007/978-3-031-17801-6_25

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-031-17800-9

  • Online ISBN: 978-3-031-17801-6

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics