Abstract
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.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Bourely, C., Caferra, R., and Peltier, N.: A method for building models automatically: Experiments with an extension of OTTER, in Proc. 12th Int. Conf. on Automated Deduction (CADE-12), LNAI 814, Springer, 1994, pp. 72–86.
BurrisS. and LeeS.: Tarski's high school identities, Amer. Math. Monthly 100, (1993), 231–236.
DavisM. and PutnamH.: A computing procedure for quantification theory, J. ACM 7 (1960), 201–215.
Fujita, M., Slaney, J., and Bennett, F.: Automatic generation of some results in finite algebra, in Proc. 13th Int. Joint Conf. on Artificial Intelligence (IJCAI-93), 1993, pp. 52–57.
Hasegawa, R., et al.: MGTP: A parallel theorem prover based on lazy model generation, in Proc. 11th Int. Conf. on Automated Deduction (CADE-11), LNAI 607, Springer, 1992, pp. 776–780.
Kim. S. and Zhang, H.: ModGen: Theorem proving by model generation, in Proc. AAAI-94, Seattle, 1994, pp. 162–167.
LeeS.-J. and PlaistedD. A.: Problem solving by searching for models with a theorem prover, Artificial Intelligence 69 (1994), 205–233.
MacHaleD.: A remark on Boolean rings, Mathematics Magazine 63 (1990), 248–249.
McCuneW.: A Davis-Putnam Program and Its Application to Finite First-Order Model Search: Quasigroup Existence Problems, Tech. Memo ANL/MCS-TM-194, Argonne National Laboratory, Argonne, IL, 1994.
Romanowska, A. B.: Private Communication, 1994.
RomanowskaA. B. and SmithJ. D. H.: Modal Theory: An Algebraic Approach to Order, Geometry, and Convexity, Heldermann Verlag, Berlin, 1985.
Slaney, J.: FINDER: Finite Domain Enumerator. Version 3.0 Notes and Guide, Australian National University, 1993.
Slaney, J.: SCOTT: A model-guided theorem prover, in Proc. 13th Int. Joint Conf. on Artificial Intelligence (IJCAI-93), 1993, pp. 109–114.
SlaneyJ., FujitaM. and StickelM.: Automated reasoning and exhaustive search: Quasigroup existence problems, Computers and Mathematics with Applications 29(2) (1995), 115–132.
Smith, J. D. H.: Private Communication, 1994.
Tammet, T.: Using resolution for deciding solvable classes and building finite models, Baltic Computer Science: Selected Papers, LNCS 502, Springer (1991), 33–64.
WinkerS.: Generation and verification of finite models and counterexamples using an automated theorem prover answering two open questions, J. ACM 29 (1982), 273–284.
WosL.: The kernel strategy and its use for the study of combinatory logic, J. Automated Reasoning 10 (1993), 287–343.
WosL.: Automated Reasoning: 33 Basic Research Problems, Prentice Hall, Englewood Cliffs, NJ, 1988.
Zhang, H., and Stickel, M.: Implementing the Davis-Putnam Algorithm by Tries, Technical Report, University of Iowa, 1994.
Zhang, J.: Search for models of equational theories, in Proc. 3rd Int. Conf. for Young Computer Scientists (ICYCS-93), Beijing, 1993, pp. 2.60–63.
Zhang, J.: Problems on the generation of finite models, in Proc. 12th Int. Conf. on Automated Deduction (CADE-12), LNAI 814, Springer, 1994, pp. 753–757.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Zhang, J. Constructing finite algebras with FALCON. J Autom Reasoning 17, 1–22 (1996). https://doi.org/10.1007/BF00247667
Received:
Accepted:
Issue Date:
DOI: https://doi.org/10.1007/BF00247667