| 2007 |
|---|
| 26 | EE | Reinhold Letz,
Gernot Stenz:
The Disconnection Tableau Calculus.
J. Autom. Reasoning 38(1-3): 79-126 (2007) |
| 2004 |
|---|
| 25 | EE | Reinhold Letz,
Gernot Stenz:
Generalised Handling of Variables in Disconnection Tableaux.
IJCAR 2004: 289-306 |
| 2003 |
|---|
| 24 | EE | Reinhold Letz,
Gernot Stenz:
Universal Variables in Disconnection Tableaux.
TABLEAUX 2003: 117-133 |
| 2002 |
|---|
| 23 | EE | Reinhold Letz:
Lemma and Model Caching in Decision Procedures for Quantified Boolean Formulas.
TABLEAUX 2002: 160-175 |
| 22 | EE | Reinhold Letz,
Gernot Stenz:
Integration of Equality Reasoning into the Disconnection Calculus.
TABLEAUX 2002: 176-190 |
| 2001 |
|---|
| 21 | EE | Reinhold Letz,
Gernot Stenz:
DCTP - A Disconnection Calculus Theorem Prover - System Abstract.
IJCAR 2001: 381-385 |
| 20 | EE | Reinhold Letz,
Gernot Stenz:
Automated Theorem Proving Proof and Model Generation with Disconnection Tableaux.
LPAR 2001: 142-156 |
| 19 | | Reinhold Letz,
Gernot Stenz:
Model Elimination and Connection Tableau Procedures.
Handbook of Automated Reasoning 2001: 2015-2114 |
| 2000 |
|---|
| 18 | | Reinhold Letz:
Properties and Relations of Tableau and Connection Calculi.
Intellectics and Computational Logic 2000: 245-261 |
| 1999 |
|---|
| 17 | | Andreas Wolf,
Reinhold Letz:
Strategy Parallelism in Automated Theorem Proving.
IJPRAI 13(2): 219-245 (1999) |
| 1998 |
|---|
| 16 | EE | Reinhold Letz:
Using Matings for Pruning Connection Tableaux.
CADE 1998: 381-396 |
| 15 | | Andreas Wolf,
Reinhold Letz:
Strategy Parallelism in Automated Theorem Proving.
FLAIRS Conference 1998: 142-146 |
| 14 | | Reinhold Letz,
Christoph Weidenbach:
Paradigmen und Perspektiven der automatischen Deduktion.
KI 12(4): 15-19 (1998) |
| 1997 |
|---|
| 13 | | Ortrun Ibens,
Reinhold Letz:
Subgoal Alternation in Model Elimination.
TABLEAUX 1997: 201-215 |
| 12 | | Reinhold Letz:
LINUS - A Link Instantion Prover with Unit Support.
J. Autom. Reasoning 18(2): 205-210 (1997) |
| 11 | | Max Moser,
Ortrun Ibens,
Reinhold Letz,
Joachim Steinbach,
Christoph Goller,
Johann Schumann,
Klaus Mayr:
SETHEO and E-SETHEO - The CADE-13 Systems.
J. Autom. Reasoning 18(2): 237-246 (1997) |
| 1994 |
|---|
| 10 | | Christoph Goller,
Reinhold Letz,
Klaus Mayr,
Johann Schumann:
SETHEO V3.2: Recent Developments - System Abstract.
CADE 1994: 778-782 |
| 9 | | Reinhold Letz,
Klaus Mayr,
Christoph Goller:
Cotrolled Integration of the Cut Rule into Connection Tableaux Calculi.
J. Autom. Reasoning 13(3): 297-337 (1994) |
| 1993 |
|---|
| 8 | | Reinhold Letz:
On the Polynomial Transparency of Resolution.
IJCAI 1993: 123-131 |
| 1992 |
|---|
| 7 | | Reinhold Letz,
Klaus Mayr:
SETHEO II - The System and its Calculi.
TABLEAUX 1992: 49-51 |
| 6 | | Reinhold Letz,
Johann Schumann,
Stefan Bayerl,
Wolfgang Bibel:
SETHEO: A High-Performance Theorem Prover.
J. Autom. Reasoning 8(2): 183-212 (1992) |
| 1990 |
|---|
| 5 | | Johann Schumann,
Reinhold Letz:
PARTHEO: A High-Performance Parallel Theorem Prover.
CADE 1990: 40-56 |
| 4 | | Johann Schumann,
Reinhold Letz,
Franz J. Kurfess:
Tutorial on High-Performance Theorem Provers: Efficient Implementation and Parallelisation.
CADE 1990: 683 |
| 1989 |
|---|
| 3 | | Wolfgang Ertel,
Franz J. Kurfess,
Reinhold Letz,
X. Pandolfi:
PARTHEO: A Parallel Inference Machine.
PARLE (1) 1989: 458-476 |
| 2 | | Stefan Bayerl,
Reinhold Letz,
Johann Schumann:
PARTHEO: A Parallel Inference Machine.
Wissensbasierte Systeme 1989: 527-539 |
| 1986 |
|---|
| 1 | | Stefan Bayerl,
Elmar Eder,
Franz J. Kurfess,
Reinhold Letz,
Johann Schumann:
An Implementation of a PROLOG-like Theorem Prover based on the Connection Method.
AIMSA 1986: 29-36 |
