AbstractThe main source of complexity problems for large influence diagrams is that the last decisions have intractably large spaces of past information. Usually, it is not a problem when you reach the last decisions; but when calculating optimal policies for the first decisions, you have to consider all possible future information scenarios. This is the curse of knowing that you shall not forget. The usual approach for addressing this problem is to reduce the information through assuming that you do forget something (Nilsson and Lauritzen, 2000, LIMID [1]), or to abstract the information through introducing new nodes (Jensen, 2008) [2]. This paper takes the opposite approach, namely to assume that you know more in the future than you actua...