Skip to main content
SpringerLink
Log in
SpringerLink
Log in

Designing an Evidential Assertion Language for Multiple Analysts

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

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

Included in the following conference series:

  • 506 Accesses

Abstract

This paper describes our work in designing an expressive evidence-based language for use by analysts as part of a decision support system for managing cyber threats. The underlying design concept for our system is that of perspective: there is not necessarily a definitive or objective means of combining all of the potential evidence, and therefore, how evidence is combined reflects a particular analyst’s point of view. We describe how our design provides flexibility to analysts in terms of expressing and combining evidence, while supporting rich interactions between analysts, and then illustrate our approach with examples.

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

References

  1. Box, G.: Science and statistics. J. Am. Stat. Assoc. 71, 791–799 (1976)

    Article  MathSciNet  MATH  Google Scholar 

  2. Denoeux, T.: Conjunctive and disjunctive combination of belief functions induced by non distinct bodies of evidence. Artif. Intell. 172, 234–264 (2008)

    Article  MathSciNet  MATH  Google Scholar 

  3. Gini, C.: On the measure of concentration with special reference to income and statistics. Colorado College Publication, General Series No. 208, pp. 73–79 (1936)

    Google Scholar 

  4. Haenni, R.: Shedding new light on Zadeh’s criticism of Dempter’s rule of combination. In: FUSION 2005, 8th International Conference on Information Fusion, vol. 2, pp. 879–884, Philadelphia, USA (2005)

    Google Scholar 

  5. Bailey, D., Harrison, A., Lierler, Y., Lifschitz, V., Michael, J.: The Winograd schema challenge and reasoning about correlation. Working Notes of the Symposium on Logical Formalizations of Commonsense Reasoning, AAAI Press (2015)

    Google Scholar 

  6. Peyton Jones, S.: The Implementation of Functional Programming. Prentice Hall International, Englewood Cliffs (1987)

    MATH  Google Scholar 

  7. Sentz, K., Ferson, S.: Combination of evidence in Dempster-Shafer Theory. Technical report, SANDIA National Laboratories (2002)

    Google Scholar 

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

    MATH  Google Scholar 

  9. Smets, P.: The combination of evidence in the transferable belief model. IEEE Pattern Anal. Mach. Intell. 12, 447–458 (1990)

    Article  Google Scholar 

  10. Smets, P., Kennes, R.: The transferable belief model. Artif. Intell. 66, 191–234 (1994)

    Article  MathSciNet  MATH  Google Scholar 

  11. Srivastava, R.: Decision making under ambiguity: a belief-function perspective. Arch. Control Sci. 6 (XLII)(1–2), 5–27 (1997)

    MathSciNet  MATH  Google Scholar 

  12. Strat, T.: Decision analysis using belief functions. Int. J. Approx. Reason. 4(5), 391–417 (1990)

    Article  MATH  Google Scholar 

  13. Yager, R.: On the Dempster-Shafer framework and new combination rules. Inf. Sci. 41, 93–137 (1987)

    Article  MathSciNet  MATH  Google Scholar 

  14. Zadeh, L.: Review of Shafer’s “A Mathematical Theory of Evidence”. AI Mag. 5, 81–83 (1984)

    Google Scholar 

  15. Dubois, D., Prade, H.: A set-theoretic view of belief functions: logical operators and approximations by fuzzy sets. Int. J. Gen Syst 12, 193–226 (1986)

    Article  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Galois, Inc., Portland, OR, USA

    David Burke

Authors
  1. David Burke
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to David Burke .

Editor information

Editors and Affiliations

  1. Czech Academy of Sciences, nstitute of Information Theory and Automation, Prague , Czech Republic

    Jiřina Vejnarová

  2. Czech Academy of Sciences, Institute of Information Theory and Automation, Prague, Czech Republic

    Václav Kratochvíl

Rights and permissions

Reprints and permissions

Copyright information

© 2016 Springer International Publishing Switzerland

About this paper

Cite this paper

Burke, D. (2016). Designing an Evidential Assertion Language for Multiple Analysts. In: Vejnarová, J., Kratochvíl, V. (eds) Belief Functions: Theory and Applications. BELIEF 2016. Lecture Notes in Computer Science(), vol 9861. Springer, Cham. https://doi.org/10.1007/978-3-319-45559-4_4

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-45559-4_4

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-45558-7

  • Online ISBN: 978-3-319-45559-4

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation