Skip to main content
SpringerLink
Log in

New Logical Classes of Plausibility Functions in Dempster-Shafer Theory of Evidence

  • Conference paper
Knowledge-Based Intelligent Information and Engineering Systems (KES 2005)

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

  • 1159 Accesses

Abstract

Several classes of the so-called logical plausibility functions are newly introduced from the point of view of modal logic. Then some systems of modal logic are shown to be both sound and complete with respect to the classes. The result will formulate the basis for developing a plausibility-based evidence theory.

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.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. Chellas, B.F.: Modal Logic: An Introduction. Cambridge University Press, Cambridge (1980)

    MATH  Google Scholar 

  2. Dubois, D., Prade, H.: A Class of Fuzzy Measures Based on Triangular Norms. Int. J. of Genaral Systems 8, 43–61 (1982)

    Article  MATH  MathSciNet  Google Scholar 

  3. Murai, T., Miyakoshi, M., Shimbo, M.: Measure-Based Semantics for Modal Logic. In: Lowen, R., Roubens, M. (eds.) Fuzzy Logic: State of the Art, pp. 395–405. Kluwer Academic Publishers, Dordrecht (1993)

    Google Scholar 

  4. Murai, T., Miyakoshi, M., Shimbo, M.: Soundness and Completeness Theorems between the Dempster-Shafer Theory and Logic of Belief. In: Proc. 3rd FUZZ-IEEE (WCCI), pp. 855–858 (1994)

    Google Scholar 

  5. Murai, T., Miyakoshi, M., Shimbo, M.: A Logical Foundation of Graded Modal Operators Defined by Fuzzy Measures. In: Proc. 4th FUZZ-IEEE, pp. 151–156 (1995)

    Google Scholar 

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

    MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Graduate School of Information Science and Technology, Hokkaido University, Sapporo, 060-0814, Japan

    Tetsuya Murai

  2. Muroran Institute of Technology, Muroran, 050-8585, Japan

    Yasuo Kudo

Authors
  1. Tetsuya Murai
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Yasuo Kudo
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. School of Business, La Trobe University, 3086, Melbourne, Victoria, Australia

    Rajiv Khosla

  2. Centre for SMART systems Engineering Research Centre, University of Brighton, Moulsecoomb, BN2 4GJ, Brighton, UK

    Robert J. Howlett

  3. School of Electrical and Information Engineering, Knowledge Based Intelligent Engineering Systems Centre, University of South Australia, 5095, Mawson Lakes, SA, Australia

    Lakhmi C. Jain

Rights and permissions

Reprints and permissions

Copyright information

© 2005 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Murai, T., Kudo, Y. (2005). New Logical Classes of Plausibility Functions in Dempster-Shafer Theory of Evidence. In: Khosla, R., Howlett, R.J., Jain, L.C. (eds) Knowledge-Based Intelligent Information and Engineering Systems. KES 2005. Lecture Notes in Computer Science(), vol 3684. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11554028_94

Download citation

  • DOI: https://doi.org/10.1007/11554028_94

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-28897-8

  • Online ISBN: 978-3-540-31997-9

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation