Equational prover
From EverybodyWiki Bios & Wiki
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]
References
- ↑ Dahn, Bernd I (October 1998). "Robbins Algebras Are Boolean: A Revision of McCune's Computer-Generated Solution of Robbins Problem". Journal of Algebra. 208 (2): 526–532. doi:10.1006/jabr.1998.7467. ISSN 0021-8693.
External links
- EQP project.
- Robbins Algebras Are Boolean.
- Argonne National Laboratory, Mathematics and Computer Science Division.
This article "Equational prover" is from Wikipedia. The list of its authors can be seen in its historical and/or the page Edithistory:Equational prover. Articles copied from Draft Namespace on Wikipedia could be seen on the Draft Namespace of Wikipedia and not main one.
