The situation is the following: I have a group of matrices (given by generators), and I am trying to find a presentation. Now, this is in general very hard (undecidable?) but here I want to know if people know heuristics for pruning the set of relators -- in other words, by computing further generations of the group, I get a number of words $w_1, \dots, w_k$ which represent the identity. No doubt some of these relations are consequences of others, so is there some nice way to remove the "dependent relations"?