| Journal of Automated Reasoning
0168-7433 | 1997 | Weidenbach, Christoph | | SPASS Version 0.49
In: Journal of Automated Reasoning [18], 247-252 | |
| Journal of Automated Reasoning
0168-7433 | 1996 | Basin, David A.
Walsh, Toby | | A Calculus for and Termination of Rippling
In: Journal of Automated Reasoning [16], 147-180 | |
| Journal of Automated Reasoning
0168-7433 | 1996 | Dimopoulos, Yannis | | On Computing Logic Programs
In: Journal of Automated Reasoning [17], 259-289 | |
| Journal of Automated Reasoning
0168-7433 | 1996 | Kraan, Ina
Basin, David A.
Bundy, Alan | | Middle-out reasoning for synthesis and induction
In: Journal of Automated Reasoning [16], 113-145 | |
| Journal of Automated Reasoning
0168-7433 | 1995 | Ohlbach, Hans Jürgen
Weidenbach, Christoph | | A Note on Assumptions about Skolem Functions
In: Journal of Automated Reasoning [15], 267-275 | |
| Journal of Automated Reasoning
0168-7433 | 1992 | Socher-Ambrosius, Rolf | | How to Avoid the Derivation of Redundant Clauses in Reasoning Systems
In: Journal of Automated Reasoning [9], 325-336 | |
| Journal of Automated Reasoning
0168-7433 | 1991 | Socher-Ambrosius, Rolf | | Optimizing the Clausal Normal Form Transformation
In: Journal of Automated Reasoning [7], 325-336 | |
| Parallel Processing Letters |
| |
| Theoretical Computer Science
0304-3975 | 1998 | Ganzinger, Harald | | Preface
In: Theoretical Computer Science [208], 1 | |
| Theoretical Computer Science
0304-3975 | 1998 | Krishna Rao, M. R. K. | | Modular Aspects of term graph rewriting
In: Theoretical Computer Science [208], 59-86 | |
| Theoretical Computer Science
0304-3975 | 1995 | Krishna Rao, M. R. K. | | Modular Proofs for Completeness of hierarchical term rewriting systems
In: Theoretical Computer Science [151], 487-512 | |
| Theoretical Computer Science
0304-3975 | 1992 | Waldmann, Uwe | | Semantics of Order-Sorted Specifications
In: Theoretical Computer Science [94], 1-35 | |
| Theoretical Computer Science
0304-3975 | 1991 | Ganzinger, Harald | | Order-Sorted Completion: The Many-Sorted Way
In: Theoretical Computer Science [89], 3-32 | |
| Theoretical Computer Science
0304-3975 | 1991 | Hanus, Michael | | Horn Clause Programs with Polymorphic Types: Semantics and Resolution
In: Theoretical Computer Science [89], 63-106 | |