2007 |
15 | EE | Christoph Weidenbach,
Renate A. Schmidt,
Thomas Hillenbrand,
Rostislav Rusev,
Dalibor Topic:
System Description: SpassVersion 3.0.
CADE 2007: 514-520 |
2004 |
14 | EE | Thomas Hillenbrand:
A Superposition View on Nelson-Oppen.
IJCAR Doctoral Programme 2004 |
2003 |
13 | EE | Harald Ganzinger,
Thomas Hillenbrand,
Uwe Waldmann:
Superposition Modulo a Shostak Theory.
CADE 2003: 182-196 |
12 | EE | Jean-Marie Gaillourdet,
Thomas Hillenbrand,
Bernd Löchner,
Hendrik Spies:
The New WALDMEISTER Loop at Work.
CADE 2003: 317-321 |
11 | EE | Thomas Hillenbrand:
Citius altius fortius: Lessons learned from the Theorem Prover WALDMEISTER.
Electr. Notes Theor. Comput. Sci. 86(1): (2003) |
10 | EE | Jürgen Avenhaus,
Thomas Hillenbrand,
Bernd Löchner:
On using ground joinable equations in equational theorem proving.
J. Symb. Comput. 36(1-2): 217-233 (2003) |
2002 |
9 | EE | Christoph Weidenbach,
Uwe Brahm,
Thomas Hillenbrand,
Enno Keen,
Christian Theobald,
Dalibor Topic:
S PASS Version 2.0.
CADE 2002: 275-279 |
8 | EE | Thomas Hillenbrand,
Bernd Löchner:
The Next W ALDMEISTER Loop.
CADE 2002: 486-500 |
7 | EE | Bernd Löchner,
Thomas Hillenbrand:
A phytography of WALDMEISTER.
AI Commun. 15(2-3): 127-133 (2002) |
2001 |
6 | EE | Robert Nieuwenhuis,
Thomas Hillenbrand,
Alexandre Riazanov,
Andrei Voronkov:
On the Evaluation of Indexing Techniques for Theorem Proving.
IJCAR 2001: 257-271 |
5 | EE | Bijan Afshordel,
Thomas Hillenbrand,
Christoph Weidenbach:
First-Order Atom Definitions Extended.
LPAR 2001: 309-319 |
1999 |
4 | EE | Thomas Hillenbrand,
Andreas Jaeger,
Bernd Löchner:
System Description: Waldmeister - Improvements in Performance and Ease of Use.
CADE 1999: 232-236 |
1997 |
3 | | Thomas Hillenbrand,
Arnim Buch,
Roland Vogt,
Bernd Löchner:
WALDMEISTER - High-Performance Equational Deduction.
J. Autom. Reasoning 18(2): 265-270 (1997) |
1996 |
2 | | Arnim Buch,
Thomas Hillenbrand,
Roland Fettig:
WALDMEISTER: High Performance Equational Theorem Proving.
DISCO 1996: 63-64 |
1 | | Thomas Hillenbrand,
Arnim Buch,
Roland Fettig:
On Gaining Efficiency in Completion-Based Theorem Proving.
RTA 1996: 432-435 |