Thomas Hillenbrand

According to our database1, Thomas Hillenbrand authored at least 17 papers between 1996 and 2013.

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

2013
Superposition for Bounded Domains.
Proceedings of the Automated Reasoning and Mathematics, 2013

From Search to Computation: Redundancy Criteria and Simplification at Work.
Proceedings of the Programming Logics - Essays in Memory of Harald Ganzinger, 2013

2007
System Description: SpassVersion 3.0.
Proceedings of the Automated Deduction, 2007

2004
A Superposition View on Nelson-Oppen.
Proceedings of the Contributions to the Doctoral Programme of the 2nd International Joint Conference on Automated Reasoning, 2004

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

Citius altius fortius: Lessons learned from the Theorem Prover WALDMEISTER.
Proceedings of the 4th International Workshop on First-Order Theorem Proving, 2003

Superposition Modulo a Shostak Theory.
Proceedings of the Automated Deduction - CADE-19, 19th International Conference on Automated Deduction Miami Beach, FL, USA, July 28, 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

S PASS Version 2.0.
Proceedings of the Automated Deduction, 2002

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

2001
First-Order Atom Definitions Extended.
Proceedings of the Logic for Programming, 2001

On the Evaluation of Indexing Techniques for Theorem Proving.
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

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

1996
On Gaining Efficiency in Completion-Based Theorem Proving.
Proceedings of the Rewriting Techniques and Applications, 7th International Conference, 1996

WALDMEISTER: High Performance Equational Theorem Proving.
Proceedings of the Design and Implementation of Symbolic Computation Systems, 1996


  Loading...