Constructing finite algebras with FALCON

The generation of models and counterexamples is an important form of reasoning. In this paper, we give a formal account of a system, called FALCON, for constructing finite algebras from given equational axioms. The abstract algorithms, as well as some implementation details and sample applications, are presented. The generation of finite models is viewed as a constraint satisfaction problem, with ground instances of the axioms as constraints. One feature of the system is that it employs a very simple technique, called the least number heuristic, to eliminate isomorphic (partial) models, thus reducing the size of the search space. The correctness of the heuristic is proved. Some experimental data are given to show the performance and applications of the system.

[1]  Tanel Tammet Using Resolution for Deciding Solvable Classes and Building Finite Models , 1991, Baltic Computer Science.

[2]  John K. Slaney,et al.  FINDER: Finite Domain Enumerator - System Description , 1994, CADE.

[3]  Ricardo Caferra,et al.  A Method for Building Models Automatically. Experiments with an Extension of OTTER , 1994, CADE.

[4]  Desmond Mac Hale A Remark on Boolean Rings , 1990 .

[5]  Stanley Burris,et al.  Tarski's High School Identities , 1993 .

[6]  Jian Zhang Problems on the Generation of Finite Models , 1994, CADE.

[7]  Jian Zhang,et al.  Search for models of equational theories , 1993 .

[8]  Steven K. Winker Generation and Verification of Finite Models and Counterexamples Using an Automated Theorem Prover Answering Two Open Questions , 1982, JACM.

[9]  David A. Plaisted,et al.  Problem Solving by Searching for Models with a Theorem Prover , 1994, Artif. Intell..

[10]  Larry Wos,et al.  The kernel strategy and its use for the study of combinatory logic , 1993, Journal of Automated Reasoning.

[11]  Anna B. Romanowska,et al.  Modal theory: An algebraic approach to order, geometry, and convexity , 1985 .

[12]  John K. Slaney SCOTT: A Model-Guided Theorem Prover , 1993, IJCAI.

[13]  Hilary Putnam,et al.  A Computing Procedure for Quantification Theory , 1960, JACM.

[14]  Hansong Zhang,et al.  Implementing the Davis-Putnam Algorithm by Tries , 1994 .

[15]  Hantao Zhang,et al.  ModGen: Theorem Proving by Model Generation , 1994, AAAI.

[16]  M. Stickel,et al.  Automated reasoning and exhaustive search: Quasigroup existence problems☆ , 1995 .

[17]  W. McCune A Davis-Putnam program and its application to finite-order model search: Quasigroup existence problems , 1994 .

[18]  Larry Wos,et al.  Automated reasoning - 33 basic research problems , 1988 .

[19]  Masayuki Fujita,et al.  Automatic Generation of Some Results in Finite Algebra , 1993, IJCAI.

[20]  Sun Kim,et al.  ModGen : Theorem Proving by Model Generatio , 1999 .

[21]  Miyuki Koshimura,et al.  MGTP: A Parallel Theorem Prover Based on Lazy Model Generation , 1992, CADE.