On Algorithmic Logic with Partial Operations. - Uwe Petermann (Logic of Programs, 1980)

A note on PCI: distributed processes communicating by interrupts. - Uwe Petermann; Andrzej Szalas (ACM SIGPLAN Notices, 1985)

An Extended Herbrand Theorem for First-Order Theories with Equality Interpreted in Partial Algebras. - Uwe Petermann (MFCS, 1989)

Programming Paradigms For Symbolic Computation Systems - Analysis Of An Example. - Uwe Petermann (DISCO, 1990)

Towards a Connection Procedure with Built in Theories. - Uwe Petermann (JELIA, 1990)

Building in equational theories into the connection method. - Uwe Petermann (FAIR, 1991)

Proving Completeness of Connection and Other First-Order Calculi with Built-In Theories (Extended Abstract). - Uwe Petermann (TABLEAUX, 1992)

Completeness of the Pool Calculus with an Open Built-in Theory. - Uwe Petermann (Kurt Gödel Colloquium, 1993)

A Complete Connection Calculus with Rigid E-Unification. - Uwe Petermann (JELIA, 1994)

Rigid Unification by Completion and Rigid Paramodulation. - Gérard Becher; Uwe Petermann (KI, 1994)

Specifications of Inference Rules and Their Automatic Translation. - Gerd Neugebauer; Uwe Petermann (TABLEAUX, 1995)

Combining Semantical and Syntactical Theory Reasoning. - Uwe Petermann (FroCoS, 1998)

Towards dependable development tools for embedded systems: a case study in software verification. - Uwe Petermann (J. Exp. Theor. Artif. Intell., 2000)

Connection Calculus Theorem Proving with Multiple Built-in Theories. - Uwe Petermann (J. Symb. Comput., 2000)

A Confluent Theory Connection Calculus. - Uwe Petermann (TABLEAUX, 2002)