Correction to: Parameterized Complexity of Dynamic Belief Updates: A Complete Map

This article investigates the computational complexity of 14 problems, and provided proofs that 12 of these were fixed-parameter intractable (FP-intractable), while the remaining 2 were fixedparameter tractable (FP-tractable).However, after publication, authors discovered an error in the proof of Theorem 3 (whose result was that the problem acopu-DBU was FP-intractable).