| 2002 |
|---|
| 14 | EE | Uwe Petermann:
A Confluent Theory Connection Calculus.
TABLEAUX 2002: 221-234 |
| 2000 |
|---|
| 13 | | Uwe Petermann:
Towards Dependable Development Tools for Embedded Systems: A Case Study in Software Verification.
FLAIRS Conference 2000: 351-355 |
| 12 | | Uwe Petermann:
Towards dependable development tools for embedded systems: a case study in software verification.
J. Exp. Theor. Artif. Intell. 12(4): 489-498 (2000) |
| 11 | | Uwe Petermann:
Connection Calculus Theorem Proving with Multiple Built-in Theories.
J. Symb. Comput. 29(2): 373-392 (2000) |
| 1995 |
|---|
| 10 | | Gerd Neugebauer,
Uwe Petermann:
Specifications of Inference Rules and Their Automatic Translation.
TABLEAUX 1995: 185-200 |
| 1994 |
|---|
| 9 | | Uwe Petermann:
A Complete Connection Calculus with Rigid E-Unification.
JELIA 1994: 152-166 |
| 8 | | Gérard Becher,
Uwe Petermann:
Rigid Unification by Completion and Rigid Paramodulation.
KI 1994: 319-330 |
| 1993 |
|---|
| 7 | | Uwe Petermann:
Completeness of the Pool Calculus with an Open Built-in Theory.
Kurt Gödel Colloquium 1993: 277-288 |
| 1992 |
|---|
| 6 | | Uwe Petermann:
Proving Completeness of Connection and Other First-Order Calculi with Built-In Theories (Extended Abstract).
TABLEAUX 1992: 64-66 |
| 1991 |
|---|
| 5 | | Uwe Petermann:
Building in equational theories into the connection method.
FAIR 1991: 156-169 |
| 1990 |
|---|
| 4 | | Uwe Petermann:
Programming Paradigms For Symbolic Computation Systems - Analysis Of An Example.
DISCO 1990: 71-80 |
| 3 | | Uwe Petermann:
Towards a Connection Procedure with Built in Theories.
JELIA 1990: 444-543 |
| 1989 |
|---|
| 2 | | Uwe Petermann:
An Extended Herbrand Theorem for First-Order Theories with Equality Interpreted in Partial Algebras.
MFCS 1989: 408-417 |
| 1980 |
|---|
| 1 | | Uwe Petermann:
On Algorithmic Logic with Partial Operations.
Logic of Programs 1980: 213-223 |
