PUMA

academical publication management
collect, organize, and share publications

( en | de )

 

Disambiguation of "Löchner, Bernd"

Author of the publication

copydeleteadd this publication to your clipboard
On using ground joinable equations in equational theorem proving.

, , and . J. Symb. Comput., 36 (1-2): 217-233 (2003)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Bernd Bertsche

Dr. rer. nat. Bernd Schulz University of Stuttgart

Bernd Peters University of Stuttgart

apl. Prof. Dr. Bernd Flemisch University of Stuttgart

Bernd Bertsche

 

Other publications of authors with the same name

The Next W ALDMEISTER Loop., and . CADE, volume 2392 of Lecture Notes in Computer Science, page 486-500. Springer, (2002)Advances in equational theorem proving: architecture, algorithms, and redundancy avoidance.. Kaiserslautern University of Technology, Germany, (2005)Unterstützung der Lehre durch Visualisierung von wissensbasierten Suchalgorithmen mit Java., , and . Java-Informations-Tage, page 180-191. Springer, (1998)A Redundancy Criterion Based on Ground Reducibility by Ordered Rewriting.. IJCAR, volume 3097 of Lecture Notes in Computer Science, page 45-59. Springer, (2004)Things to Know when Implementing KBO.. J. Autom. Reasoning, 36 (4): 289-310 (2006)A phytography of WALDMEISTER., and . AI Commun., 15 (2-3): 127-133 (2002)System Description: Waldmeister - Improvements in Performance and Ease of Use., , and . CADE, volume 1632 of Lecture Notes in Computer Science, page 232-236. Springer, (1999)Unification of Higher-Order patterns in a Simply Typed Lambda-Calculus with Finite Products and terminal Type., and . RTA, volume 1103 of Lecture Notes in Computer Science, page 347-361. Springer, (1996)Knuth-Bendix completion of theories of commuting group endomorphisms., and . Inf. Process. Lett., 98 (5): 195-198 (2006)On using ground joinable equations in equational theorem proving., , and . J. Symb. Comput., 36 (1-2): 217-233 (2003)