Automatic generation of some results in finite algebra

Authors:
Masayuki Fujita;John Slaney;Frank Bennett
Affiliations:
Mitsubishi Research Institute, Meguro-ku, Tokyo, Japan;Australian National University, Canberra, ACT, Australia;Department of Mathematics, Mount St Vincent University, Halifax, Nova Scotia, Canada
Venue:
IJCAI'93 Proceedings of the 13th international joint conference on Artifical intelligence - Volume 1
Year:
1993

Citing 4
Cited 21

A Prolog technology theorem prover: implementation by an extended Prolog computer

Journal of Automated Reasoning
SATCHMO: A Theorem Prover Implemented in Prolog

Proceedings of the 9th International Conference on Automated Deduction
Automated Reasoning Contributed to Mathematics and Logic

Proceedings of the 10th International Conference on Automated Deduction
OTTER 2.0

Proceedings of the 10th International Conference on Automated Deduction

Automatic symmetry breaking method combined with SAT

Proceedings of the 2001 ACM symposium on Applied computing
Compiling Problem Specifications into SAT

ESOP '01 Proceedings of the 10th European Symposium on Programming Languages and Systems
A Model Generation Based Theorem Prover MGTP for First-Order Logic

Computational Logic: Logic Programming and Beyond, Essays in Honour of Robert A. Kowalski, Part II
The Non-existence of (3, 1, 2)-Conjugate Orthogonal Idempotent Latin Square of Order 10

CP '01 Proceedings of the 7th International Conference on Principles and Practice of Constraint Programming
The eXtended Least Number Heuristic

IJCAR '01 Proceedings of the First International Joint Conference on Automated Reasoning
Classifying Isomorphic Residue Classes

Computer Aided Systems Theory - EUROCAST 2001-Revised Papers
Computer Search for Large Sets of Idempotent Quasigroups

Computer Mathematics
Compiling problem specifications into SAT

Artificial Intelligence - Special volume on reformulation
Reducing Symmetries to Generate Easier SAT Instances

Electronic Notes in Theoretical Computer Science (ENTCS)
Kodkod: a relational model finder

TACAS'07 Proceedings of the 13th international conference on Tools and algorithms for the construction and analysis of systems
A translational approach to constraint answer set solving

Theory and Practice of Logic Programming
Problem structure in the presence of perturbations

AAAI'97/IAAI'97 Proceedings of the fourteenth national conference on artificial intelligence and ninth conference on Innovative applications of artificial intelligence
Combining local search and backtracking techniques for constraint satisfaction

AAAI'96 Proceedings of the thirteenth national conference on Artificial intelligence - Volume 1
Algorithm portfolio design: theory vs. practice

UAI'97 Proceedings of the Thirteenth conference on Uncertainty in artificial intelligence
A new set of algebraic benchmark problems for SAT solvers

SAT'05 Proceedings of the 8th international conference on Theory and Applications of Satisfiability Testing
Blocking and other enhancements for bottom-up model generation methods

IJCAR'06 Proceedings of the Third international joint conference on Automated Reasoning
A powerful technique to eliminate isomorphism in finite model search

IJCAR'06 Proceedings of the Third international joint conference on Automated Reasoning
Translation-based constraint answer set solving

IJCAI'11 Proceedings of the Twenty-Second international joint conference on Artificial Intelligence - Volume Volume Three
A Hybrid Method for Finite Model Search in Equational Theories

Fundamenta Informaticae
SCSat: a soft constraint guided SAT solver

SAT'13 Proceedings of the 16th international conference on Theory and Applications of Satisfiability Testing
MACE4 and SEM: a comparison of finite model generators

Automated Reasoning and Mathematics

Quantified Score

Hi-index	0.01

Visualization

Abstract

This is a report of the application of the Model Generation Theorem Prover developed at ICOT to problems in the theory of finite quasigroups. Several of the problems were previously open. In this paper, we discuss our theorem proving methods, related to those of the existing provers SATCHMO (Manthey, Bry) and OTTER (McCune), and note how parallel processing on the ICOT Parallel Inference Machines was used to obtain high speeds. We then present and discuss our machine-aided investigation of seven problems concerning the existence of types of quasigroup.