Terminator

Authors:
Grigorios Antoniou;Hans Jurgen Ohlbach
Affiliations:
Institut fur Informatik I, University of Karlsruhe;Institut fur Informatik I, University of Karlsruhe
Venue:
IJCAI'83 Proceedings of the Eighth international joint conference on Artificial intelligence - Volume 2
Year:
1983

Citing 7
Cited 2

Semi-Automated Mathematics

Journal of the ACM (JACM)
A Proof Procedure Using Connection Graphs

Journal of the ACM (JACM)
Another Generalization of Resolution

Journal of the ACM (JACM)
Theorem Proving via General Matings

Journal of the ACM (JACM)
On Matrices with Connections

Journal of the ACM (JACM)
Problems and Experiments for and with Automated Theorem-Proving Programs

IEEE Transactions on Computers
A Search Technique for Clause Interconnectivity Graphs

IEEE Transactions on Computers

An Open Research Problem: Strong Completeness of R. Kowalski's Connection Graph Proof Procedure

Computational Logic: Logic Programming and Beyond, Essays in Honour of Robert A. Kowalski, Part II
Deduction with XOR constraints in security API modelling

CADE' 20 Proceedings of the 20th international conference on Automated Deduction

Quantified Score

Hi-index	0.02

Visualization

Abstract

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 refutations. 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.