How many valuations of these literals satisfy this expression? considering all the possible valuations of literals A, B, C, D, E, F, G and H (256 valuations in total), how would you go about finding how many of these valuations satisfy this expression:
$$ (A\rightarrow B) \wedge (B\rightarrow C) \wedge (D\rightarrow E) \wedge (F\rightarrow G) \wedge (G\rightarrow H)$$
I know I could draw the truth table with all the possible valuations, but what's a more efficient method? The solution that I calculated through software simulation should be 48.

Take subsets and then combinations.
From A,B,C we can make a subset, that has I think 4 solutions.
For F,G,H, the same.
And for D,E only 3 solution.
But all combinations can occur, so 4x4x3
