Automated Theorem Proving in Quasigroup and Loop Theory

ATP in Quasigroups and Loops
Phillips, Stanovský
[MPV03] W. McCune, R. Padmanabhan, R. Veroff, Yet another single law for lattices, Algebra Universalis 50
(2003), no. 2, 165–169.
[MVFHFW02] W. McCune, R. Veroff, B. Fitelson, K. Harris, A. Feist, L. Wos, Short single axioms for Boolean
algebra, J. Automat. Reason. 29 (2002), no. 1, 1–16.
[Nag08] G. P. Nagy. A class of finite simple Bol loops of exponent 2, to appear in Trans. Amer. Math. Soc., 2008.
[NV07] G. P. Nagy and P. Vojtěchovský, Computing with small quasigroups and loops, Quasigroups and Related
Systems 15 (2007), 77–94.
[Pfl90] H. O. Pflugfelder, Quasigroups and Loops: Introduction, Sigma Series in Pure Mathematics 7, Heldermann
Verlag Berlin, 1990.
[Pfl00] H. O. Pflugfelder, Historical notes on loop theory, Comment. Math. Univ. Carolin. 41/2 (2000), 359–370.
[Phi03] J.D. Phillips, See Otter digging for algebraic pearls, Quasigroups and Related Systems, 10 (2003), 95–
114.
[Phi06] J.D. Phillips, A short basis for the variety of WIP PACC-loops, Quasigroups and Related Systems, 14
(2006), 73–80.
[Phi06b] J.D. Phillips, Short equational bases for two varieties of groupoids associated with involuted restrictive
bisemigroups of binary relations, Semigroup Forum 73, No. 2, 308-312 (2006).
[Pud07] P. Pudlák, Semantic Selection of Premisses for Automated Theorem Proving, proceedings of the ESARLT
Workshop, Bremen, 2007.
[PS08] J.D. Phillips, D. Stanovský, Automated theorem proving in loop theory, proceedings of the ESARM
workshop, Birmingham, 2008.
[PSxx] J.D. Phillips, D. Stanovský, Loops with abelian inner mapping groups, work in progress.
[PV05a] J.D. Phillips and P. Vojtěchovský, The varieties of loops of Bol-Moufang type, Algebra Universalis, 54
(3) (2005), 259–271.
[PV05b] J.D. Phillips and P. Vojtěchovský, The varieties of quasigroups of Bol-Moufang type: an equational
reasoning approach, Journal of Algebra, 293 (2005), 17–33.
[PV05c] J.D. Phillips and P. Vojtěchovský, Linear groupoids and the associated wreath products, Journal of Symbolic
Computation, 40 (3), (2005), 1106–1125.
[PV06] J.D. Phillips and P. Vojtěchovský, C-loops: an introduction, Publicationes Mathematicae Debrecen,
68/1–2 (2006), p. 115–137.
[PV08] J.D. Phillips and P. Vojtěchovský, A scoop from groups: new equational foundations for loops, Commentationes
Mathematicae Universitatis Carolinae, 49/2 (2008), 279–290.
[RV02] A. Riazanov, A. Voronkov, The Design and Implementation of Vampire, AI Communications 15(2-3)
(2002), 91–110.
[S] http://www.spass-prover.org/
[Sch02] S. Schulz, E: A Brainiac Theorem Prover, AI Communications 15(2-3) (2002), 111–126.
[SV08] M. Spinks, R. Veroff, Constructive logic with strong negation is a substructural logic, Studia Logica 88/3
(2008), 325–348.
[Sta08] D. Stanovský, Distributive groupoids are symmetric-by-medial: An elementary proof, Comment. Math.
Univ. Carolinae 49/4 (2008), 541–546.
[SS98] G. Sutcliffe, C. Suttner, The TPTP Problem Library: CNF Release v1.2.1, Journal of Automated Reasoning,
21/2 (1998), 177–203.
[SS06] G. Sutcliffe, C. Suttner, The State of CASC, AI Communications 19/1 (2006), 35–48.
[Tam97] T. Tammet, Gandalf, J. of Automated Reasoning 18/2 (1997), 199–204.
[Ver01] R. Veroff, Solving open questions and other challenge problems using proof sketches, J. Automated
Reasoning 27(2) (2001), 157–174.
[VM] R. Veroff, W. McCune, http://www.cs.unm.edu/~veroff/MEDIAN ALGEBRA/
[VS06] R. Veroff, M. Spinks, Axiomatizing the skew Boolean propositional calculus, J. Automat. Reason. 37
(2006), no. 1-2, 3–20 (2007).
20