| 2007 |
|---|
| 23 | EE | Tal Lev-Ami,
Christoph Weidenbach,
Thomas W. Reps,
Mooly Sagiv:
Labelled Clauses.
CADE 2007: 311-327 |
| 22 | EE | Christoph Weidenbach,
Renate A. Schmidt,
Thomas Hillenbrand,
Rostislav Rusev,
Dalibor Topic:
System Description: SpassVersion 3.0.
CADE 2007: 514-520 |
| 2002 |
|---|
| 21 | EE | Christoph Weidenbach,
Uwe Brahm,
Thomas Hillenbrand,
Enno Keen,
Christian Theobald,
Dalibor Topic:
S PASS Version 2.0.
CADE 2002: 275-279 |
| 2001 |
|---|
| 20 | EE | Bijan Afshordel,
Thomas Hillenbrand,
Christoph Weidenbach:
First-Order Atom Definitions Extended.
LPAR 2001: 309-319 |
| 19 | | Christoph Weidenbach:
Combining Superposition, Sorts and Splitting.
Handbook of Automated Reasoning 2001: 1965-2013 |
| 18 | | Andreas Nonnengart,
Christoph Weidenbach:
Computing Small Clause Normal Forms.
Handbook of Automated Reasoning 2001: 335-367 |
| 1999 |
|---|
| 17 | EE | Christoph Weidenbach:
Towards an Automatic Analysis of Security Protocols in First-Order Logic.
CADE 1999: 314-328 |
| 16 | EE | Christoph Weidenbach:
System Description: Spass Version 1.0.0.
CADE 1999: 378-382 |
| 15 | EE | Ullrich Hustadt,
Renate A. Schmidt,
Christoph Weidenbach:
MSPASS: Subsumption Testing with SPASS.
Description Logics 1999 |
| 1998 |
|---|
| 14 | EE | Andreas Nonnengart,
Georg Rock,
Christoph Weidenbach:
On Generating Small Clause Normal Forms.
CADE 1998: 397-411 |
| 13 | EE | Florent Jacquemard,
Christoph Meyer,
Christoph Weidenbach:
Unification in Extension of Shallow Equational Theories.
RTA 1998: 76-90 |
| 12 | | Reinhold Letz,
Christoph Weidenbach:
Paradigmen und Perspektiven der automatischen Deduktion.
KI 12(4): 15-19 (1998) |
| 1997 |
|---|
| 11 | | Harald Ganzinger,
Christoph Meyer,
Christoph Weidenbach:
Soft Typing for Ordered Resolution.
CADE 1997: 321-335 |
| 10 | | Christoph Weidenbach:
SPASS - Version 0.49.
J. Autom. Reasoning 18(2): 247-252 (1997) |
| 1996 |
|---|
| 9 | | Christoph Weidenbach,
Bernd Gaede,
Georg Rock:
SPASS & FLOTTER Version 0.42.
CADE 1996: 141-145 |
| 8 | | Christoph Weidenbach:
Unification in Pseudo-Linear Sort Theories is Decidable.
CADE 1996: 343-357 |
| 7 | | Christoph Weidenbach:
Unification in Sort Theories and Its Applications.
Ann. Math. Artif. Intell. 18(2-4): 261-293 (1996) |
| 1995 |
|---|
| 6 | | Hans Jürgen Ohlbach,
Christoph Weidenbach:
A Note on Assumptions about Skolem Functions.
J. Autom. Reasoning 15(2): 267-275 (1995) |
| 5 | EE | Christoph Weidenbach:
First-Order Tableaux with Sorts.
Logic Journal of the IGPL 3(6): 887-906 (1995) |
| 1993 |
|---|
| 4 | | Christoph Weidenbach:
Extending the Resolution Method with Sorts.
IJCAI 1993: 60-65 |
| 1992 |
|---|
| 3 | | Christoph Weidenbach:
A New Sorted Logic.
GWAI 1992: 43-54 |
| 2 | | Manfred Kerber,
Christoph Weidenbach:
Deduktionssysteme.
KI 6(3): 14-22 (1992) |
| 1990 |
|---|
| 1 | | Christoph Weidenbach,
Hans Jürgen Ohlbach:
A Resolution Calculus with Dynamic Sort Structures and Partial Functions.
ECAI 1990: 688-693 |
