Nowhere FO dense conjecture for FO model checking

Let $\mathcal{D}$ be a graph class, and for every FO formula $\psi(x,y)$ let $F_\psi$ be a graph such that $F_\psi$ is not an induced subgraph of any member of $I_\psi(\mathcal{D})$. Nowhere FO dense conjecture. If $\mathcal{D}$ has this property, then $\mathcal{D}$ has an FPT algorithm for FO model checking. This conjecture proposes a logical analogue of nowhere denseness and asks whether the associated forbidden-induced-subgraph condition guarantees fixed-parameter tractability; the source gives no resolution.