R. Letz, K. Mayr, C. Goller  Home/Search
Context Related
| wwwjessen.informatik.tum...jar94.ps.gz Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: wwwjessen.informatik....deduction (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: . In this paper techniques are developed and compared which 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 ... (Update)
Cited by: More
Optimising minimal Herbrand model generation procedures - Georgieva (2003) (Correct)
Persistent and Quasi-Persistent Lemmas - In Propositional Model (Correct)
System Description: KRHyper - Wernhard (2003) (Correct)
Similar documents (at the sentence level):
67.2%: Controlled Integrations of the Cut - Rule Into Connection (Correct)
Active bibliography (related documents): More All
0.6: Non-Elementary Speed-Ups in Proof Length by Different Variants of.. - Egly (Correct)
0.4: Analysis and Transformation of Proof Procedures - de Waal (1994) (Correct)
0.3: Lemma and Cut Strategies for Propositional Model Elimination - Van Gelder, Okushi (1999) (Correct)
Similar documents based on text: More All
0.2: SETHEO and E-SETHEO - The CADE-13 Systems - Moser, Ibens, Letz, Steinbach.. (1997) (Correct)
0.1: A Connectionist Control Component for the Theorem Prover SETHEO - Goller (1994) (Correct)
0.1: Distributed Representations for Terms in Hybrid Reasoning.. - Sperduti, Starita, Göller (1995) (Correct)
Related documents from co-citation: More All
29: SETHEO: A high-performance theorem prover (context) - Letz, Schumann et al. - 1992
24: First-Order Logic and Automated Theorem Proving (context) - Fitting - 1990
22: The TPTP Problem Library - Sutcliffe, Suttner et al. - 1994
BibTeX entry: (Update)
R. Letz, K. Mayr, and C. Goller. Controlled Integrations of the Cut Rule into Connection Tableau Calculi. Journal of Automated Reasoning, 13, 1994. http://citeseer.ist.psu.edu/letz94controlled.html More
@article{ letz94controlled,
author = "R.~Letz and K.~Mayr and C.~Goller",
title = "Controlled Integration of the Cut Rule into Connection Tableau Calculi",
journal = "Journal of Automated Reasoning,",
volume = "13",
number = "3",
pages = "297--338",
year = "1994",
url = "citeseer.ist.psu.edu/letz94controlled.html" }
Citations (may not include all citations):278 Depth-First Iterative Deepening: an Optimal Admissible Tree .. (context) - Korf - 1985
235 First Order Logic (context) - Smullyan - 1968
186 Automated Theorem Proving: a Logical Basis (context) - Loveland - 1978
142 Automated Theorem Proving (context) - Bibel - 1987
131 SETHEO: A High-Performance Theorem Prover (context) - Letz, Schumann et al. - 1992
97 A Prolog Technology Theorem Prover: Implementation by an Ext.. - Stickel - 1988
74 Mechanical Theorem Proving by Model Elimination (context) - Loveland - 1968
69 On Matrices with Connections (context) - Bibel - 1981
47 Linear Resolution with Selection Function (context) - Kowalski, Kuehner - 1971
47 The Foundations of Mathematics (context) - Beth - 1959
41 Caching and Lemmaizing in Model Elimination Theorem Provers - Astrachan, Stickel - 1992
28 An Improved Proof Procedure (context) - Prawitz - 1960
19 Consolution and its Relation with Resolution (context) - Eder - 1991
19 Artificial Intelligence (context) - Shostak - 1976
16 METEORs: High Performance Theorem Provers using Model Elimin.. (context) - Astrachan, Loveland - 1991
16 A Simplified Format for the Model Elimination Theorem-Provin.. (context) - Loveland - 1969
15 First-Order Calculi and Proof Procedures for Automated Deduc.. (context) - Letz - 1993
11 IEEE Transactions on Computers (context) - Wilson, Minker et al. - 1976
7 A Unifying View of some Linear Herbrand Procedures (context) - Loveland - 1972
6 Technische Universitat Munchen (context) - Letz, Power et al. - 1993
3 Mededlingen der Koninklijke Nederlandse Akademie van Wetensc.. (context) - Beth, Formal - 1955
3 Refinements and Extensions of Model Elimination (context) - Mayr - 1993
3 the Lenghts of Proofs in the Propositional Calculus (context) - Reckhow - 1976
2 The Relation of Extended Tableau Systems with Semantic Trees (context) - Letz, Mayr - 1993
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://wwwjessen.informatik.tu-muenchen.de/~goller/deduction.html):
SETHEO and E-SETHEO - The CADE-13 Systems - Moser, Ibens, Letz, Steinbach.. (1997) (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC