Controlled integration of the cut rule into connection tableau calculi

  title={Controlled integration of the cut rule into connection tableau calculi},
  author={Reinhold Letz and Klaus Mayr and Christoph Goller},
  journal={Journal of Automated Reasoning},
In this paper techniques are developed and compared that increase the inferential power of tableau systems for classical first-order logic. The mechanisms are formulated in the framework of connection tableaux, which is an amalgamation of the connection method and the tableau calculus, and a generalization of model elimination. Since connection tableau calculi are among the weakest proof systems with respect to proof compactness, and the (backward) cut rule is not suitable for the first-order… CONTINUE READING
Highly Influential
This paper has highly influenced 18 other papers. REVIEW HIGHLY INFLUENTIAL CITATIONS


Publications citing this paper.
Showing 1-10 of 101 extracted citations

Autarky Pruning in Propositional Model Elimination Reduces Failure Redundancy

Journal of Automated Reasoning • 1999
View 10 Excerpts
Highly Influenced

Linear and unit-resulting refutations for Horn theories

Journal of Automated Reasoning • 1996
View 5 Excerpts
Highly Influenced


Publications referenced by this paper.
Showing 1-10 of 32 references

METEORs: High Performance Theorem Provers Using Model Elimination

Automated Reasoning: Essays in Honor of Woody Bledsoe • 1991
View 7 Excerpts
Highly Influenced

Automated theorem proving: a logical basis

Fundamental studies in computer science • 1978
View 8 Excerpts
Highly Influenced

Polynomial Simulation of Sequent Systems by Tree Sequent Systems

R. Letz
Technical report, Technische Universit~tt Miinchen, • 1993
View 6 Excerpts
Highly Influenced

A prolog technology theorem prover: Implementation by an extended prolog compiler

Journal of Automated Reasoning • 1988
View 4 Excerpts
Highly Influenced

Automated Theorem Proving

Artificial Intelligence / Künstliche Intelligenz • 1982
View 5 Excerpts
Highly Influenced

Mechanical Theorem-Proving by Model Elimination

J. ACM • 1968
View 5 Excerpts
Highly Influenced

The Relation of Extended Tableau Systems with Semantic Trees and Linear Resolution, Technical report

R. Letz, K. Mayr
Technische Universit~it Miinchen, • 1994
View 2 Excerpts

The TPTP Problem Library

Journal of Automated Reasoning • 1994
View 1 Excerpt

Similar Papers

Loading similar papers…