Automated reasoning and exhaustive search: Quasigroup existence problems
From MaRDI portal
Publication:1343395
DOI10.1016/0898-1221(94)00219-BzbMath0827.20083OpenAlexW2082167089MaRDI QIDQ1343395
Publication date: 3 December 1995
Published in: Computers \& Mathematics with Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0898-1221(94)00219-b
Symbolic computation and algebraic computation (68W30) Orthogonal arrays, Latin squares, Room squares (05B15) Loops, quasigroups (20N05) Software, source code, etc. for problems pertaining to group theory (20-04)
Related Items
Introduction to the OBDD algorithm for the ATP community, Studying quasigroup identities by rewriting techniques: Problems and first results, Automatic construction of finite algebras, Applying SAT solving in classification of finite algebras, Incomplete idempotent Schröder quasigroups and related packing designs, Ordered Binary Decision Diagrams and the Davis-Putnam procedure, Comparing approaches to the exploration of the domain of residue classes., Further Results on the Construction of Mutually Orthogonal Latin Squares and the Falsity of Euler's Conjecture, Automatic construction and verification of isotopy invariants, System description generating models by SEM, Parallelizing SMT solving: lazy decomposition and conciliation, MACE4 and SEM: A Comparison of Finite Model Generators, The crisis in finite mathematics: Automated reasoning as cause and cure
Uses Software
Cites Work
