Theoretical Computer ScienceVolume 90, Issue 1, 11 November 1991, Pages 199-208Rapid construction of algebraic axioms from samplesAuthor links open overlay panelJ.M. Barzdin, G.J. BarzdinShow moreShareCitehttps://doi.org/10.1016/0304-3975(91)90307-NGet rights and contentUnder an Elsevier user licenseopen archiveAbstractAn axiom is called reliable if it is confirmed in several places in a given sample of algebra. A very effective algorithm for enumerating such axioms is described.Previous article in issueNext article in issueRecommended articlesCited by (0)Copyright © 1991 Published by Elsevier B.V.
