The terminator
暂无分享,去创建一个
The Markgraf Karl Refutation Procedure (MKR-Procedure) is an automated theorem prover for sorted logic, based on an extended clause graph calculus, currently under development at the University of Karlsruhe. This paper describes the TERMINATOR module, a component of the MKR-Procedure, which is essentially a very fast algorithm for the search for unit refuta-tions. The TERMINATOR is used as a fast pre-theorem prover as well as an integral component of the system , and is called for different tasks during the search for a proof.
[1] Robert A. Kowalski,et al. A Proof Procedure Using Connection Graphs , 1975, JACM.
[2] Larry Wos,et al. Problems and Experiments for and with Automated Theorem-Proving Programs , 1976, IEEE Transactions on Computers.
[3] Sharon Sickel,et al. A Search Technique for Clause Interconnectivity Graphs , 1976, IEEE Transactions on Computers.