In previous papers, I presented an inference method for rst-order logic based on the transformation between canonical normal forms (Bittencourt, 1994) and a concurrent algorithm for this transformation that, in the one hand, generates only clauses that are not subsumed by any other and, in the other hand, is naturally concurrent and therefore easy to parallelize (Bitten-court, 1995). This algor...