We present an algorithm for the generation of prime implicates in equational logic, that is, of
the most general consequences of formulæ containing equations and disequations between
first-order terms. This algorithm is defined by a calculus that is proved to be correct and
complete. We then focus on the case where the considered clause set is ground, ie, contains
no variables, and devise a specialized tree data structure that is designed to efficiently
detect and delete redundant implicates. The corresponding algorithms are presented along …

… Why equational logic? Many results available in propositional logic. Few practical results
available in more expressive logics. Equality required for many applications (eg verification). …