foundations of computational agents
The following are the main points you should have learned from this chapter:
Probability is a measure of belief in a proposition.
The posterior probability is used to update an agent’s beliefs based on evidence.
A Bayesian belief network is a representation of conditional independence of random variables.
Exact inference can be carried out efficiently for sparse graphs (with low treewidth) using recursive conditioning or variable elimination.
A hidden Markov model or a dynamic belief network can be used for probabilistic reasoning about sequences, such as changes over time or words in sentences, with applications such as robot localization and extracting information from language.
Stochastic simulation is used for approximate inference.