Automated theorem proving in quasigroup and loop theory

We survey all known results in the area of quasigroup and loop theory to have been obtained with the assistance of automated theorem provers. We provide both informal and formal descriptions of selected problems, and compare the performance of selected state-of-the art first order theorem provers on them. Our analysis yields some surprising results, e.g., the theorem prover most often used by loop theorists does not necessarily yield the best performance.

• Type: Journal
• Year: 2010
• Where: AICOM
• Authors: J. D. Phillips, David Stanovský
• Keywords: AICOM 2010, Automated Theorem Provers, Formal Descriptions, Theorem Provers