The Markgraf Karl refutation procedure

Authors:
K. Blasius;N. Fisinger;J. Siekmann;G. Smolka;A. Herold;C. Walther
Affiliations:
Institut fur Informatik I, Universitat Karlsruhe, Karlsruhe, Postfach;Institut fur Informatik I, Universitat Karlsruhe, Karlsruhe, Postfach;Institut fur Informatik I, Universitat Karlsruhe, Karlsruhe, Postfach;Institut fur Informatik I, Universitat Karlsruhe, Karlsruhe, Postfach;Institut fur Informatik I, Universitat Karlsruhe, Karlsruhe, Postfach;Institut fur Informatik I, Universitat Karlsruhe, Karlsruhe, Postfach
Venue:
IJCAI'81 Proceedings of the 7th international joint conference on Artificial intelligence - Volume 1
Year:
1981

Citing 10
Cited 1

Automated Theorem-Proving for Theories with Simplifiers Commutativity, and Associativity

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

Journal of the ACM (JACM)
Confluent Reductions: Abstract Properties and Applications to Term Rewriting Systems: Abstract Properties and Applications to Term Rewriting Systems

Journal of the ACM (JACM)
Complete Sets of Reductions for Some Equational Theories

Journal of the ACM (JACM)
Experiments in automatic learning for a multipurpose hueristic program

Communications of the ACM
Canonical Forms and Unification

Proceedings of the 5th Conference on Automated Deduction
A short survey on the state of the art in matching and unification problems

ACM SIGSAM Bulletin
Problems and Experiments for and with Automated Theorem-Proving Programs

IEEE Transactions on Computers
Resolution, Refinements, and Search Strategies: A Comparative Study

IEEE Transactions on Computers
Conflunt reductions: Abstract properties and applications to term rewriting systems

SFCS '77 Proceedings of the 18th Annual Symposium on Foundations of Computer Science

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

Quantified Score

Hi-index	0.00

Visualization

Abstract

The current state of a Theorem Proving System (The Markgraf Karl Refutation Procedure) at the University of Karlsruhe is presented. The goal of this project can be summarized by the following three claims: it is possible to program a theorem prover (TP) and augment it by appropriate heuristics and domain-specific knowledge such that (i) it will display an 'active' and directed behaviour in its striving for a proof, rather than the 'passive' combinatorial search through very large search spaces, which was the characteristic behaviour of the TPs of the past. Consequently. (ii) it will not generate a search space of many thousands of irrelevant clauses, but will find a proof with comparatively few redundant derivation steps. (iii) Such a TP will establish an unprecedented leap in performance over previous TPs expressed in terms of the difficulty of the theorems it can prove. The results obtained thus far corroborate the first two claims.