SCOTT: A Model-Guided Theorem Prover
暂无分享,去创建一个
SCOTT (Semantically Constrained Otter) is a resolution-based automatic theorem prover for first order logic. It is based on the high performance prover OTTER by W. McCune and also incorporates a model generator. This finds finite models which SCOTT is able to use in a variety of ways to direct its proof search. Clauses generated by the prover are in turn used as axioms of theories to be modelled. Thus prover and model generator inform each other dynamically. This paper describes the algorithm and some sample results.
[1] Richard C. T. Lee,et al. Symbolic logic and mechanical theorem proving , 1973, Computer science classics.
[2] E. L. Lusk,et al. An entry in the 1992 Overbeek theorem-proving contest , 1992 .
[3] James R. Slagle,et al. Automatic Theorem Proving With Renamable and Semantic Resolution , 1967, JACM.
[4] C. Morgan,et al. Automated Theorem Proving in Non-Classical Logics , 1995 .