If $H$ is a finitely generated subgroup of $G$ and if $H$ given by say a finite set of words which generate it, then the generalized word problem for $H$ in $G$ is the problem of deciding for an arbitrary word $w$ in $G$ whether or not $w$ lies in the subgroup $H$.
In "Computable algebra and group embeddings", it is shown that one can solve the generalized word problem for finitely generated, abelian-by-nilpotent groups. Is this result generalized to the finitely generated abelian by polycyclic groups?