This paper focuses on the efficient computation of answer sets for normal logic programs. It concentrates on a recently proposed rule-based method (implemented in the noMoRe system) for computing answer sets.We show how noMoRe and its underlying method can be improved tremendously by extending the computation of deterministic consequences. With these changes noMoRe is able to deal with more challenging problem classes.