Specifying Latin Square Problems in Propositional Logic

  title={Specifying Latin Square Problems in Propositional Logic},
  author={Hantao Zhang},
This chapter discusses how to specify various Latin squares so that their existence can be eeciently decided by computer programs. The computer programs considered here are so-called general-purpose model generation programs (or simply model generators) that are used to solve constraint satisfaction problems in AI, to prove theorems in nite domains, or to produce counterexamples to false conjectures. For instance, any example of nite structures in Larry Wos's book 16] can be easily solved using… CONTINUE READING
Highly Cited
This paper has 34 citations. REVIEW CITATIONS


Publications referenced by this paper.
Showing 1-10 of 18 references

First results of studying quasigroup identities by rewriting techniques

M. Stickel, H. Zhang
Proc. ofWorkshop on Automated Theorem Proving in conjunction with FGCS'94, • 1994
View 20 Excerpts
Highly Influenced

Conjugate-orthogonal Latin squares and related structures

F. Bennett, L. Zhu
View 8 Excerpts
Highly Influenced

A Davis-Putnam program and its application to nite rst-order model search: Quasigroup existence problems

W. McCune
Technical Report ANL/MCS-TM-194, Argonne National Laboratory, • 1994
View 6 Excerpts
Highly Influenced

FINDER: Finite Domain Enumerator - System Description

CADE • 1994
View 7 Excerpts
Highly Influenced

Constructing nite algebras with FALCON

J. Zhang
J. of Automated Reasoning, • 1996
View 9 Excerpts
Highly Influenced

Search for idempotent models of quasigroup identities, typescript, Institute of Software, Academia

J. Zhang
Sinica, Beijing, • 1991
View 7 Excerpts
Highly Influenced

Similar Papers

Loading similar papers…