{"type":"ScholarlyArticle","title":"TERMINATOR","authors":[{"name":"Grigoris Antoniou","slug":"grigoris-antoniou","given":"Grigoris","family":"Antoniou","affiliation":"Institut flir Informatik I , University of Karlsruhe"},{"name":"Hans Jürgen Ohlbach","slug":"hans-jurgen-ohlbach","given":"Hans Jürgen","family":"Ohlbach","affiliation":"Institut flir Informatik I , University of Karlsruhe"}],"abstract":"The Markgraf Karl Refutation Procedure (MKR-Procedure) is an automated theorem prover for sorted logic, based on an extended clause graph calculus, current-ly under development at the University of Karlsruhe . This paper describes th e TERMINATOR module, a component of the MKR-Procedure, which is essentially a very fast algorithm for the search for unit refutati o ns. 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.","doi":null,"url":"https://ijcai.org/proceedings/1983/215","pdf":"https://ijcai.org/proceedings/1983/0215.pdf","markdown":"https://ijcai.org/proceedings/1983/215.md","bibtex":"https://ijcai.org/proceedings/1983/bibtex/215","volume":{"slug":"1983","title":"Proceedings of the Eighth International Joint Conference on Artificial Intelligence","short_title":"IJCAI 1983","url":"https://ijcai.org/proceedings/1983/","year":1983,"location":"Karlsruhe, West Germany","dates":"","editors":"Alan Bundy","isbn":"","publisher":"International Joint Conferences on Artificial Intelligence","doi_prefix":""},"section":"Theorem Proving","track":"Theorem Proving","number":215,"pages":{"first":916,"last":918},"keywords":[],"videos":[],"references":[{"position":1,"raw":"P.B. Andrews Theorem proving via general matings. J. ACM 28:2 (1981) 193-214","title":"Theorem proving via general matings","authors":"P B Andrews","year":"1981","venue":"J. ACM","doi":null,"url":null,"internal_url":null},{"position":2,"raw":"W. Bibel On Matrices with Connections. J. ACM 28:4 (1981) 633 -645 .","title":"On Matrices with Connections","authors":"W Bibel","year":"1981","venue":"J. ACM","doi":null,"url":null,"internal_url":null},{"position":3,"raw":"McCharen, Overbeck, Wos Problems and Experiments for and with Automatic Theorem Proving Programs. IEEE Transactions on Computers C-25:8 (1976) 773-782.","title":"Wos Problems and Experiments for and with Automatic Theorem Proving Programs","authors":"Overbeck Mccharen","year":"1976","venue":"IEEE Transactions on Computers C","doi":null,"url":null,"internal_url":null},{"position":4,"raw":"C.L. Chang, J.R. Slagle Using Rewrite Rules for Connection Graphs to Prove Theorems. Artificial Intelligence 12 (1979) 159-180.","title":"Using Rewrite Rules for Connection Graphs to Prove Theorems","authors":"C L Chang, J R Slagle","year":"1979","venue":"Artificial Intelligence","doi":null,"url":null,"internal_url":null},{"position":5,"raw":"Guard, Oglesby, Bennet, Settle Semi-Automated Mathematics J. ACM 16:1 (1969).","title":"Settle Semi-Automated Mathematics J","authors":"Guard, Bennet Oglesby","year":"1969","venue":"ACM","doi":null,"url":null,"internal_url":null},{"position":6,"raw":"M.C. Harrison and N. Rubin Another generalization of resolution. J. ACM 25 :3 (1978) 341-351.","title":"Another generalization of resolution","authors":"M C Harrison, N Rubin","year":"1978","venue":"J. ACM","doi":null,"url":null,"internal_url":null},{"position":7,"raw":"Kapur, Krishnamoorthy, Narendra A linear Algorithm for Unification. General Electric Rep. no 82CRD-100 New York (1982) .","title":"Narendra A linear Algorithm for Unification","authors":"Krishnamoorthy Kapur","year":"1982","venue":"General Electric Rep","doi":null,"url":null,"internal_url":null},{"position":8,"raw":"R. Kowalski A Proof Procedure Using Connection Graphs. J. ACM 22:4 (1975).","title":"A Proof Procedure Using Connection Graphs","authors":"R Kowalski","year":"1975","venue":"J. ACM","doi":null,"url":null,"internal_url":null},{"position":9,"raw":"H.J. Ohlbach The Markgraf Karl Refutation Procedure. The Logic Engine. Interner Bericht 24/82, University of Karlsruhe (1982).","title":"The Markgraf Karl Refutation Procedure. The Logic Engine","authors":"H J Ohlbach","year":"1982","venue":"Interner Bericht","doi":null,"url":null,"internal_url":null},{"position":10,"raw":"H.J. Ohlbach The Markgraf Karl Refutation Procedure. The TERMINATOR Module. Interner Bericht, University of Karlsruhe (1983).","title":"The Markgraf Karl Refutation Procedure. The TERMINATOR Module","authors":"H J Ohlbach","year":"1983","venue":null,"doi":null,"url":null,"internal_url":null},{"position":11,"raw":"J. van vaalen An Extension of Unification to Substitutions with an application to ATP. Proc. IJCAI-75, Tbilisi, USSR (1975).","title":"vaalen An Extension of Unification to Substitutions with an application to ATP","authors":"J Van","year":"1975","venue":"Proc. IJCAI-75","doi":null,"url":null,"internal_url":null},{"position":12,"raw":"S. Sickel A Search Technique for Clause Interconnectivity Graphs. IEEE Transactions on Computers C-25:8 (1976).","title":"A Search Technique for Clause Interconnectivity Graphs","authors":"S Sickel","year":"1976","venue":"IEEE Transactions on Computers C","doi":null,"url":null,"internal_url":null}],"license_note":"Copyright International Joint Conferences on Artificial Intelligence."}