default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDReinhold Letz
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2000 – 2009
- 2007
[j7]Reinhold Letz, Gernot Stenz:
The Disconnection Tableau Calculus. J. Autom. Reason. 38(1-3): 79-126 (2007)- 2004
- [c18]Reinhold Letz, Gernot Stenz:
Generalised Handling of Variables in Disconnection Tableaux. IJCAR 2004: 289-306 - 2003
- [c17]Reinhold Letz, Gernot Stenz:
Universal Variables in Disconnection Tableaux. TABLEAUX 2003: 117-133 - 2002
- [c16]Reinhold Letz:
Lemma and Model Caching in Decision Procedures for Quantified Boolean Formulas. TABLEAUX 2002: 160-175 - [c15]Reinhold Letz, Gernot Stenz:
Integration of Equality Reasoning into the Disconnection Calculus. TABLEAUX 2002: 176-190 - 2001
- [c14]Reinhold Letz, Gernot Stenz:
DCTP - A Disconnection Calculus Theorem Prover - System Abstract. IJCAR 2001: 381-385 - [c13]Reinhold Letz, Gernot Stenz:
Automated Theorem Proving Proof and Model Generation with Disconnection Tableaux. LPAR 2001: 142-156 - [p1]Reinhold Letz, Gernot Stenz:
Model Elimination and Connection Tableau Procedures. Handbook of Automated Reasoning 2001: 2015-2114 - 2000
- [c12]Reinhold Letz:
Properties and Relations of Tableau and Connection Calculi. Intellectics and Computational Logic 2000: 245-261
1990 – 1999
- 1999
- [j6]Andreas Wolf, Reinhold Letz:
Strategy Parallelism in Automated Theorem Proving. Int. J. Pattern Recognit. Artif. Intell. 13(2): 219-245 (1999) - 1998
- [j5]Reinhold Letz, Christoph Weidenbach:
Paradigmen und Perspektiven der automatischen Deduktion. Künstliche Intell. 12(4): 15-19 (1998) - [c11]Reinhold Letz:
Using Matings for Pruning Connection Tableaux. CADE 1998: 381-396 - [c10]Andreas Wolf, Reinhold Letz:
Strategy Parallelism in Automated Theorem Proving. FLAIRS 1998: 142-146 - 1997
- [j4]Reinhold Letz:
LINUS - A Link Instantion Prover with Unit Support. J. Autom. Reason. 18(2): 205-210 (1997) - [j3]Max Moser, Ortrun Ibens, Reinhold Letz, Joachim Steinbach, Christoph Goller, Johann Schumann, Klaus Mayr:
SETHEO and E-SETHEO - The CADE-13 Systems. J. Autom. Reason. 18(2): 237-246 (1997) - [c9]Ortrun Ibens, Reinhold Letz:
Subgoal Alternation in Model Elimination. TABLEAUX 1997: 201-215 - 1994
- [j2]Reinhold Letz, Klaus Mayr, Christoph Goller:
Cotrolled Integration of the Cut Rule into Connection Tableaux Calculi. J. Autom. Reason. 13(3): 297-337 (1994) - [c8]Christoph Goller, Reinhold Letz, Klaus Mayr, Johann Schumann:
SETHEO V3.2: Recent Developments - System Abstract. CADE 1994: 778-782 - 1993
- [b1]Reinhold Letz:
First-order calculi and proof procedures for automated deduction. Darmstadt University of Technology, Germany, 1993, pp. 1-195 - [c7]Reinhold Letz:
On the Polynomial Transparency of Resolution. IJCAI 1993: 123-131 - 1992
- [j1]Reinhold Letz, Johann Schumann, Stefan Bayerl, Wolfgang Bibel:
SETHEO: A High-Performance Theorem Prover. J. Autom. Reason. 8(2): 183-212 (1992) - [c6]Reinhold Letz, Klaus Mayr:
SETHEO II - The System and its Calculi. TABLEAUX 1992: 49-51 - [i6]Reinhold Letz:
Connection tableaux and their relation with linear resolution. Forschungsberichte, TU Munich FKI 169 92: 1-18 (1992) - [i5]Reinhold Letz:
On the polynomial transparency of resolution. Forschungsberichte, TU Munich FKI 172 92: 1-17 (1992) - 1990
- [c5]Johann Schumann, Reinhold Letz:
PARTHEO: A High-Performance Parallel Theorem Prover. CADE 1990: 40-56 - [c4]Johann Schumann, Reinhold Letz, Franz J. Kurfess
:
Tutorial on High-Performance Theorem Provers: Efficient Implementation and Parallelisation. CADE 1990: 683 - [i4]Reinhold Letz, Klaus Mayr:
Proof schemata in propositional calculi. Forschungsberichte, TU Munich FKI 144 90: 1-19 (1990) - [i3]Johann Schumann, Reinhold Letz:
PARTHEO: a high performance parallel theorem prover. Forschungsberichte, TU Munich TUM I 9009: 1-17 (1990)
1980 – 1989
- 1989
- [c3]Wolfgang Ertel, Franz J. Kurfess, Reinhold Letz, Xavier Pandolfi:
PARTHEO: A Parallel Inference Machine. PARLE (1) 1989: 458-476 - [c2]Stefan Bayerl, Reinhold Letz, Johann Schumann:
PARTHEO: A Parallel Inference Machine. Wissensbasierte Systeme 1989: 527-539 - [i2]Reinhold Letz:
Classical negation in logic programming. Forschungsberichte, TU Munich FKI 123 89: 1-8 (1989) - 1988
- [i1]Reinhold Letz:
Expressing first order logic within Horn Clause logic. Forschungsberichte, TU Munich FKI 96 88: 1-12 (1988) - 1986
- [c1]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
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-24 22:47 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
