Supporting active rules has become an important characteristic of modern database systems. Active rules termination is an important problem of active database. To prove termination by using triggering and activation graphs has conservativeness. In order to refine the existing works, the formula constructed for an effective activation path is proposed in this paper and a novel approach about how to determine the termination of active rules set is presented. The analytical results prove that the proposed approach can detect more termination situations than any other existing works. Moveover, an algorithm for termination decision is provided, and its correctness and termination are proved.