{"type":"ScholarlyArticle","title":"The Markgraf Karl Refutation Procedure","authors":[{"name":"Karl-Hans Bläsius","slug":"karl-hans-blasius","given":"Karl-Hans","family":"Bläsius","affiliation":""},{"name":"Norbert Eisinger","slug":"norbert-eisinger","given":"Norbert","family":"Eisinger","affiliation":""},{"name":"Jörg H. Siekmann","slug":"jorg-h-siekmann","given":"Jörg H.","family":"Siekmann","affiliation":""},{"name":"Gert Smolka","slug":"gert-smolka","given":"Gert","family":"Smolka","affiliation":""},{"name":"Alexander Herold","slug":"alexander-herold","given":"Alexander","family":"Herold","affiliation":""},{"name":"Christoph Walther","slug":"christoph-walther","given":"Christoph","family":"Walther","affiliation":""}],"abstract":"The cuPrent st a te of a TheoPem Proving Sy s te m (The MaPkgmf KaPt Refutation FPocedure) at the Unive Psity of KaPtsPUh e is pPesented. The goat of this pPojec t c an be swrurrJ.rized by the fotl-owing thPee cl- aims: i t is possibLe to progpam a theoPem proveP ( TPJ and augment it by appPopPiate heuristics and do main-specific knowLedge such that (iJ it witt displ-ay an 'active' and directed behavi o UP in its striving foP a pPoof, PatheP than th e 'passive' combinatorial- seaPChthPough ve ry t a Pg e seaPch spaces, which was the chaPa ct e risti c behaviouP of the TPs of the past. Consequentl-y (ii) it witt not genePate a seaPCh space of many thousands of iPPetevant cl-auses, but witt find a proof with comparativel-y few Pedundant dePivat io n steps. (iii) Such a TP witt establ-ish an unprecedented l-eap in pePformance oveP previous TPs e;rppessed in terms of the difficuLty of the theoPems it can prove. The resuLts obtained thus far coPPOboPate the first two cl aims.","doi":null,"url":"https://ijcai.org/proceedings/1981/96","pdf":"https://ijcai.org/proceedings/1981/0096.pdf","markdown":"https://ijcai.org/proceedings/1981/96.md","bibtex":"https://ijcai.org/proceedings/1981/bibtex/96","volume":{"slug":"1981","title":"Proceedings of the Seventh International Joint Conference on Artificial Intelligence","short_title":"IJCAI 1981","url":"https://ijcai.org/proceedings/1981/","year":1981,"location":"Vancouver, British Columbia, Canada","dates":"24-28 August 1981","editors":"Roger C. Schank","isbn":"","publisher":"International Joint Conferences on Artificial Intelligence","doi_prefix":""},"section":"Theorem Proving","track":"Theorem Proving","number":96,"pages":{"first":511,"last":517},"keywords":[],"videos":[],"references":[],"license_note":"Copyright International Joint Conferences on Artificial Intelligence."}