We propose an original approach to prove termination of innermost rewriting on ground term algebras, based on induction, abstraction and narrowing. Our method applies in particular to non-terminating systems which are innermost terminating, and to systems that do not innermost terminate on the free term algebra but do on the ground term one. The induction relation, an F-stable ordering having the subterm property, is not given a priori, but its existence is checked along the proof, by testing satisfiability of ordering constraints. The method is based on an abstraction mechanism, introducing variables that represent ground terms in normal form, and on narrowing, schematizing reductions on ground terms. An extension of the method is given, where the noetherian induction is strengthened by a structural induction. A variant is also proposed, to characterize terminating subset of the ground term algebra, for non-innermost terminating system. Finally, the method is adapted in a natural way to outermost termination.