Abstract
Manthey and Bry's model generation approach to theorem proving for FOPC has been greeted with considerable interest. Unfortunately the original presentation of the technique can become arbitrarily inefficient when applied to problems whose statements contain large amounts of irrelevant information. We show how to avoid these problems whilst retaining nearly all the advantages of the basic approach.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Bibel, W., Letz, R. and Schumann, J. (1987): Bottom-up Enhancements of Deductive Systems, MS., Technische Universität München.
Eisinger, N. (1986): Everything you always wanted to know about clause graph resolution’, CADE 8, pp. 316–336.
Kaplan, R. M. (1973): ‘A general syntactic processor’, in R. Rustin, Natural Language Processing, Algorithmics Press, New York pp. 193–241.
Kay, M. (1973): ‘The MIND system’ in R. Rustin, Natural Language Processing, Algorithmics Press, New York, pp. 155–188.
Kowalski, R. (1975): ‘A proof procedure using connection graphs’, JACM 22(4), pp. 572–595.
Manthey, R. and Bry, F. (1988) ‘SATCHMO: a theorem prover in PROLOG’, CADE-88.
Pelletier, J. F. (1986): ‘Seventy five problems for testing automatic theorem provers’, Journal of Automated Reasoning 2, 191–216.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Ramsay, A. Generating relevant models. J Autom Reasoning 7, 359–368 (1991). https://doi.org/10.1007/BF00249019
Received:
Accepted:
Issue Date:
DOI: https://doi.org/10.1007/BF00249019