Several authors have proposed increasingly efficient methods for computing the least general generalization of two clauses under theta-subsumption. The most expensive step in this computation is the reduction of the clause to its minimal size. In general, this requires testing all literals for redundancy, which in the worst case requires a thetasubsumption test for each of them. In this paper, ...