As an example of the combination process and how it can be done efficiently,
consider Boolean AND. Given a simple network for a query node q with two parent
nodes a and b, as shown in Figure 7.5, we can describe the conditional probabilities
as shown in Table 7.6.