An editor has nominated this article for deletion. You are welcome to participate in the deletion discussion , which will decide whether to keep it. |
 | This article may rely excessively on sources too closely associated with the subject , potentially preventing the article from being verifiable and neutral.(March 2024) |
EQP (Equational prover) is an automated theorem proving program for equational logic, developed by the Mathematics and Computer Science Division of the Argonne National Laboratory. It was one of the provers used for solving a longstanding problem posed by Herbert Robbins, namely, whether all Robbins algebras are Boolean algebras. A simplified version of the EQP proof was later published by Bernd Dahn. [1]