EQP
This article is about automated theorem proving. For the complexity class named EQP, see EQP (complexity).
EQP, an abbreviation for 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.
External links
- EQP project.
- Robbins Algebras Are Boolean.
- Argonne National Laboratory, Mathematics and Computer Science Division.
This article is issued from Wikipedia - version of the 9/17/2013. The text is available under the Creative Commons Attribution/Share Alike but additional terms may apply for the media files.