Skip to main content

Reasoning in Uncertain Environments

  • Chapter
  • First Online:
Fundamentals of Artificial Intelligence

Abstract

 Real-life propositions are neither fully true nor false, also there is always some uncertainty associated with them. Therefore, the reasoning using real-life knowledge should also be in accord. This chapter is aimed to fulfill the above objectives. The chapter presents the prerequisites—foundations of probability theory, conditional probability, Bayes theorem, and Bayesian networks which are graphical representation of conditional probability, propagation of beliefs through these networks, and the limitations of Bayes theorem. Application of Bayesian probability has been demonstrated for specific problem solutions. Another theory—the Dempster–Shafer theory of evidence—which provides better results as the evidences increase is presented, and has been applied on worked examples. Reasoning using fuzzy sets is yet another approach for reasoning in uncertain environments—a theory where membership of sets is partial. Inferencing using fuzzy relations and fuzzy rules has been demonstrated, followed by chapter summary, and a set of exercises at the end.

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 64.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Hardcover Book
USD 84.99
Price excludes VAT (USA)
  • Durable hardcover 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

Notes

  1. 1.

    NP-Hard: Non-deterministic Polynomial-hard, i.e., whose polynomial nature of complexity is unknown, and these problems are considered as the hardest problems in Computer Science.

  2. 2.

    d-separation: A method to determine which variables are independent in a Bayes net [3].

  3. 3.

    \(H\rightarrow E\) is a hypothesis relation, where H is hypothesis and E is evidence.

References

  1. Chowdhary KR (2015) Fundamentals of discrete mathematical structures, 3rd edn. EEE, PHI India

    MATH  Google Scholar 

  2. Darwiche A (2010) Bayesian networks. Commun ACM 53(12):80–90

    Article  Google Scholar 

  3. http://web.mit.edu/jmn/www/6.034/d-separation.pdf. Cited 19 Dec 2017

  4. Heckerman D, Wellman MP (1995) Bayesian networks. Commun ACM 38(3):27–30

    Article  Google Scholar 

  5. Kay RU (2007) Fundamentals of the dempster-shafer theory and its applications to system safety and reliability modelling. J Pol Saf Reliab Asso 2:283–295

    Google Scholar 

  6. Munakata T, Jani Y (1994) Fuzzy systems: an overview. Commun ACM 37(3):69–77

    Google Scholar 

  7. Puppe F (1993) Systematic introduction to expert systems. Springer

    Google Scholar 

  8. Zadeh LA (1994) Fuzzy logic, neural networks, soft computing. Commun ACM 37(3):77–84

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to K. R. Chowdhary .

Exercises

Exercises

  1. 1.

    We assume a domain of 5-card poker hands out of a deck of 52 cards. Answer the following under the assumption that it is a fair deal.

    1. a.

      How many 5-card hands can be there (i.e., number of atomic events in joint probability distribution).

    2. b.

      What is the probability of an atomic event?

    3. c.

      What is the probability that a hand will comprise four cards of the same rank?

  2. 2.

    Either prove it is true or give a counterexample in each of the following statements.

    1. a.

      If \(P(a \mid b, c) = P(a)\), then show that \(P(b \mid c) = P(b)\).

    2. b.

      If \(P(a \mid b, c) = P(b \mid a, c)\), then show that \(P(a \mid c) = P(b \mid c)\).

    3. c.

      If \(P(a \mid b) = P(a)\), then show that \(P(a \mid b, c) = P(a \mid c)\).

  3. 3.

    Consider that for a coin, the probability that when tossed the head appears up is x and for tails it is \(1 - x\). Answer the following:

    1. a.

      Given that the value of x is unknown, are the outcomes of successive flips of this coin independent of each other? Justify your answer in the case of head and tail.

    2. b.

      Given that we know the value of x, are the outcomes of successive flips of the coin independent of each other? Justify.

  4. 4.

    Show that following statements of conditional independence,

    $$P(X \mid Z) P(Y | Z) = P(X, Y \mid Z)$$

    are also equivalent to each of the following statements,

    $$ P(Y \mid Z) = P(Y \mid X, Z),$$

    and

    $$P(X \mid Z) = P(X \mid Y, Z).$$
  5. 5.

    Out of two new nuclear power stations, one of them will give an alarm when the temperature gauge sensing the core temperature exceeds a given threshold. Let the variables be Boolean types: A = alarm sounds, FA =alarm be faulty, and FG = gauge be faulty. The multivalued nodes are G = reading of gauge, and T = actual core temperature.

    1. a.

      Given that the gauge is more likely to fail when the core temperature goes too high, draw a Bayesian network for this domain.

    2. b.

      Assume that there are just two possible temperatures: actual and measured, normal and high. Let the probability that the gauge gives the correct reading be x when it is working, and y when it is faulty. Find out the conditional probability associated with G.

    3. c.

      Assume that the alarm and gauge are correctly working, and the alarm sounds. Find out an expression for the probability in terms of the various conditional probabilities in the network, that the temperature of the core is too high.

    4. d.

      Let the alarm work correctly unless it is faulty. In case of being faulty, it never sounds. Give the conditional probability table associated with A.

  6. 6.

    Compute the graphical representation of the fuzzy membership in the graph 12.19 for following set operations:

    1. a.

      \(Small \cap Tall\)

    2. b.

      \((Small \cup Medium)\)Tall

  7. 7.

    Given the fuzzy sets \(A = \{\frac{a}{0.5}, \frac{b}{0.9}, \frac{e}{1}\}\), \(B=\{\frac{b}{0.7}, \frac{c}{0.9}, \frac{d}{0.1}\}\), Compute \(A \cup B\), \(A \cap B, A^\prime , B^\prime \).

  8. 8.

    Let \(X = \{ a, b, c, d, e\}\), \(A = \{\frac{a}{0.5}, \frac{c}{0.3}, \frac{e}{1}\}\). Compute:

    1. a.

      \(\bar{A}\)

    2. b.

      \(\bar{A} \cap A\)

    3. c.

      \(\bar{A} \cup A\)

Rights and permissions

Reprints and permissions

Copyright information

© 2020 Springer Nature India Private Limited

About this chapter

Check for updates. Verify currency and authenticity via CrossMark

Cite this chapter

Chowdhary, K.R. (2020). Reasoning in Uncertain Environments. In: Fundamentals of Artificial Intelligence. Springer, New Delhi. https://doi.org/10.1007/978-81-322-3972-7_12

Download citation

  • DOI: https://doi.org/10.1007/978-81-322-3972-7_12

  • Published:

  • Publisher Name: Springer, New Delhi

  • Print ISBN: 978-81-322-3970-3

  • Online ISBN: 978-81-322-3972-7

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics