Bernd Löchner

According to our database1, Bernd Löchner authored at least 14 papers between 1996 and 2006.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2006
Things to Know when Implementing KBO.
J. Autom. Reason., 2006

Knuth-Bendix completion of theories of commuting group endomorphisms.
Inf. Process. Lett., 2006

Things to Know When Implementing Lpo.
Int. J. Artif. Intell. Tools, 2006

2005
Advances in equational theorem proving: architecture, algorithms, and redundancy avoidance.
PhD thesis, 2005

2004
A Redundancy Criterion Based on Ground Reducibility by Ordered Rewriting.
Proceedings of the Automated Reasoning - Second International Joint Conference, 2004

2003
On using ground joinable equations in equational theorem proving.
J. Symb. Comput., 2003

The New WALDMEISTER Loop at Work.
Proceedings of the Automated Deduction - CADE-19, 19th International Conference on Automated Deduction Miami Beach, FL, USA, July 28, 2003

2002
A phytography of WALDMEISTER.
AI Commun., 2002

The Next W ALDMEISTER Loop.
Proceedings of the Automated Deduction, 2002

2001
CCE: Testing Ground Joinability.
Proceedings of the Automated Reasoning, First International Joint Conference, 2001

1999
System Description: Waldmeister - Improvements in Performance and Ease of Use.
Proceedings of the Automated Deduction, 1999

1998
Unterstützung der Lehre durch Visualisierung von wissensbasierten Suchalgorithmen mit Java.
Proceedings of the JIT '98, 1998

1997
WALDMEISTER - High-Performance Equational Deduction.
J. Autom. Reason., 1997

1996
Unification of Higher-Order patterns in a Simply Typed Lambda-Calculus with Finite Products and terminal Type.
Proceedings of the Rewriting Techniques and Applications, 7th International Conference, 1996


  Loading...