Uwe Petermann

According to our database, Uwe Petermann authored at least 15 papers between 1980 and 2002.

Collaborative distances:

• Dijkstra number of five.
• Erdős number of four.

2002

A Confluent Theory Connection Calculus.

Uwe Petermann

Proceedings of the Automated Reasoning with Analytic Tableaux and Related Methods, 2002

2000

Connection Calculus Theorem Proving with Multiple Built-in Theories.

Uwe Petermann

J. Symb. Comput., 2000

Towards dependable development tools for embedded systems: a case study in software verification.

Uwe Petermann

J. Exp. Theor. Artif. Intell., 2000

1998

Combining Semantical and Syntactical Theory Reasoning.

Uwe Petermann

Proceedings of the Frontiers of Combining Systems, Second International Workshop, 1998

1995

Specifications of Inference Rules and Their Automatic Translation.

Gerd Neugebauer, Uwe Petermann

Proceedings of the Theorem Proving with Analytic Tableaux and Related Methods, 1995

1994

Rigid Unification by Completion and Rigid Paramodulation.

Gérard Becher, Uwe Petermann

Proceedings of the KI-94: Advances in Artificial Intelligence, 1994

A Complete Connection Calculus with Rigid E-Unification.

Uwe Petermann

Proceedings of the Logics in Artificial Intelligence, European Workshop, 1994

1993

Completeness of the Pool Calculus with an Open Built-in Theory.

Uwe Petermann

Proceedings of the Computational Logic and Proof Theory, Third Kurt Gödel Colloquium, 1993

1992

Proving Completeness of Connection and Other First-Order Calculi with Built-In Theories (Extended Abstract).

Uwe Petermann

Proceedings of the Workshop Theorem Proving with Analytic Tableaux and Related Methods, 1992

1991

Building in equational theories into the connection method.

Uwe Petermann

Proceedings of the Fundamentals of Artificial Intelligence Research, 1991

1990

Towards a Connection Procedure with Built in Theories.

Uwe Petermann

Proceedings of the Logics in AI, European Workshop, 1990

Programming Paradigms For Symbolic Computation Systems - Analysis Of An Example.

Uwe Petermann

Proceedings of the Design and Implementation of Symbolic Computation Systems, 1990

1989

An Extended Herbrand Theorem for First-Order Theories with Equality Interpreted in Partial Algebras.

Uwe Petermann

Proceedings of the Mathematical Foundations of Computer Science 1989, 1989

1985

A note on PCI: distributed processes communicating by interrupts.

Uwe Petermann, Andrzej Szalas

ACM SIGPLAN Notices, 1985

1980

On Algorithmic Logic with Partial Operations.

Uwe Petermann

Proceedings of the Logics of Programs and Their Applications, 1980