Abstract
CLIN-S is an instance-based, clause-form first-order theorem prover. CLIN-S employs three inference procedures: semantic hyper-linking, which uses semantics to guide the proof search and performs well on non-Horn parts of the proofs involving small literals, rough resolution, which removes large literals in the proofs, and UR resolution, which proves the Horn parts of the proofs. A semantic structure for the input clauses is given as input. During the search for the proof, ground instances of the input clauses are generated and new semantic structures are built based on the input semantics and a model of the ground clause set. A proof is found if the ground clause set is unsatisfiable. In this article, we describe the system architecture and major inference rules used in CLIN-S.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Bledsoe, W. W.: Challenge problems in elementary calculus, J. Automated Reasoning 6 (1990), 341–359.
Chu, H.: Semantically Guided First-Order Theorem Proving Using Hyper-Linking, PhD thesis, University of North Carolina at Chapel Hill, 1994.
Chu, H. and Plaisted, D. A.: Model finding strategies in semantically guided instance-based theorem proving, in Jan Komorowski and Zbigniew W. Rás (eds), Proc. 7th International Symposium on Methodologies for Intelligent Systems (ISMIS-93), 15-18 June 1993, pp. 19–28.
Chu, H. and Plaisted, D. A.: Rough resolution: A refinement of resolution to remove large literals, in Proc. Eleventh National Conference on Artificial Intelligence (AAAI-93), 11-15 July 1993, pp. 15–20.
Chu, H. and Plaisted, D. A.: Model finding in semantically guided instance-based theorem proving, Foundamenta Informaticae Journal 21(3) (1994), 221–235.
Chu, H. and Plaisted, D. A.: Semantically guided first-order theorem proving using hyperlinking, in Alan Bundy (ed.), Proc. of CADE-12, Nancy, France, 1994, pp. 192–206.
Davis, M. and Putnamm, H.: A computing procedure for quantification theory, J. ACM 7(3) (1960), 201–215.
Gilmore, P. C.: A proof method for quantification theory: Its justification and realization, IBM J. Res. Dev. 4(1) (1960), 28–35.
Herbrand, J.: Researches in the theory of demonstration, in J. van Heijenoort (ed.), From Frege to Göel: a Source Book in Mathematical Logic, 1879-1931, Harvard Univ. Press, 1974, pp. 525–581.
Lee, S.-J.: CLIN: An Automated Reasoning System Using Clause Linking, PhD thesis, University of North Carolina at Chapel Hill, 1990.
Lee, S.-J. and Plaisted, D. A.: Eliminating duplication with the hyper-linking strategy, J. Automated Reasoning 9 (1992), 25–42.
Quintus Computer Systems, Inc. Quintus Prolog User's Guide.
Wos, L.: Automated Reasoning: 33 Basic Research Problems, Prentice-Hall, Englewood Cliffs, NJ, 1988.
Wos, L., Overbeek, R., Lusk, E. and Boyle, J.: Automated Reasoning: Introduction and Applications, Prentice-Hall, Inc., Englewood Cliffs, NJ, 1984.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Chu, H., Plaisted, D.A. CLIN-S - A Semantically Guided First-Order Theorem Prover. Journal of Automated Reasoning 18, 183–188 (1997). https://doi.org/10.1023/A:1005875128672
Issue Date:
DOI: https://doi.org/10.1023/A:1005875128672