Abstract.In this paper we describe an algorithm for computation of an extended characteristic set for a differential ideal generated by a finite number of differential polynomials. This algorithm improves the Kolchin-Ritt algorithm by using algebraic Gröbner bases in the sense that it constructs an extended characteristic set which has rank either less than or equal to the one from the Kolchin-Ritt algorithm. We give explicit examples when the inequality holds.