Author(s)

Journal Title/Source

AI Communications

Publication Date

2010

Volume

23

Page Numbers

267–283

Document Type

Journal Article

Department

Mathematics and Computer Science

Abstract

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 doesn’t necessarily yield the best performance.

Share

COinS