Abstract
LINUS is a theorem prover for clause logic based on hyperlinking. The main new feature of the system is the emphasis on the preference for unit clauses, which are generated as a by-product of the hyperlinking method. The mechanism of unit support also motivates a slightly different interpretation of hyperlinking, namely, as mate saturation. Mate saturation can be viewed as a generalization of unit-resulting resolution that is compatible with any set-of-support strategy. We give a survey on the theoretical background and the architecture of the system, and decribe its performance.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Chang, C. and Lee, R.: Symbolic Logic and Mechanical Theorem Proving, Academic Press, 1973.
Davis, M. and Putnam, H.: A computing procedure for quantification theory, Journal of the ACM 7 (1960), 201–215.
Lee, S.-J. and Wu, C.-H.: Improving the efficiency of a hyperlinking-based theorem prover by incremental evaluation with network structures, Journal of Automated Reasoning 12(3) (1994), 359–388.
Lee, S.-J. and Plaisted, D.: Eliminating duplication with the hyper-linking strategy, Journal of Automated Reasoning 9(1) (1992), 25–42.
Sutcliffe, G. and Suttner, C. B.: The results of the CADE-13 ATP system competition, Journal of Automated Reasoning 18(2) (1997).
Sutcliffe, G., Suttner, C. B. and Yemenis, T.: The TPTP problem library, in A. Bundy (ed.), Proc. of the 12th International Conference on Automated Deduction, Lecture Notes in Artificial Intelligence 814, Springer-Verlag, 1994, pp. 252–266.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Letz, R. LINUS - A Link Instantion Prover with Unit Support. Journal of Automated Reasoning 18, 205–210 (1997). https://doi.org/10.1023/A:1005839531398
Issue Date:
DOI: https://doi.org/10.1023/A:1005839531398