Abstract
Recently, the subject of model generation has received much attention. By model generation we mean the automated generation of finite models of a given set of logical formulas. In this note, we present some problems on the generation of finite models. The purpose is two-fold: (1) to offer some test problems for model generation programs; and (2) to show the potential applications of such programs. Some of the problems are easy, some are hard and even open. We also give a new result in combinatory logic, which says that the fragment {B, N 1 } does not possess the strong fixed point property.
Supported in part by the Natural Science Foundation of China.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
Burris, S., and Lee, S., “Tarski's high school identities,” The Amer. Math. Monthly 100 (1993) 231–236.
Fujita, M. et al, “Automatic generation of some results in finite algebra,” Proc. 13th IJCAI (1993) 52–57.
Hasegawa, R. et al, “'MGTP: A parallel theorem prover based on lazy model generation,” Proc. 11th CADE, LNAI 607 (1992) 776–780.
Kolesova, G. et al, “On the number of 8×8 Latin squares,” J. Combinatorial Theory A54 (1990) 143–148.
Manthey, R., and Bry, F.,“SATCHMO: A theorem prover implemented in Prolog,” Proc. 9th CADE, LNCS 310 (1988) 415–434.
McCune, W., “Single axioms for groups and Abelian groups with various operations,” J. Automated Reasoning 10 (1993) 1–13.
Peterson, J. G., “The possible shortest single axioms for EC-tautologies,” Report No. 105, Dept. of Mathematics, Univ. of Auckland (1977).
Slaney, J., “FINDER: Finite domain enumerator. Version 3.0 notes and guide,” Australian National University, (1993).
Winker, S., “Generation and verification of finite models and counterexamples using an automated theorem prover answering two open questions,” J. ACM 29 (1982) 273–284.
Winker, S., “Robbins algebra: Conditions that make a near-Boolean algebra Boolean,” J. Automated Reasoning 6 (1990) 465–489.
Wos, L. et al, “A new use of an automated reasoning assistant: Open questions in equivalential calculus and the study of infinite domains,” Artificial Intelligence 22 (1984) 303–356.
Wos, L. “Meeting the challenge of fifty years of logic,” J. Automated Reasoning 6 (1990) 213–232.
Wos, L., “The kernel strategy and its use for the study of combinatory logic,” J. Automated Reasoning 10 (1993) 287–343.
Zhang, H., and Stickel, M., “Implementing the Davis-Putnam method by tries,” submitted to AAAI-94.
Zhang, J., “Search for models of equational theories,” Proc. 3rd Int'l Conf. for Young Computer Scientists (ICYCS-93), Beijing (1993) 2.60–63.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1994 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Zhang, J. (1994). Problems on the generation of finite models. In: Bundy, A. (eds) Automated Deduction — CADE-12. CADE 1994. Lecture Notes in Computer Science, vol 814. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-58156-1_54
Download citation
DOI: https://doi.org/10.1007/3-540-58156-1_54
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-58156-7
Online ISBN: 978-3-540-48467-7
eBook Packages: Springer Book Archive