We describe an answer-set programming solver smodels− , derived from smodels by eliminating some lookahead computations. We show that for some classes of programs smodels− outperforms smodels and demonstrate the computational potential of our approach.