 | 2005 |
| 12 |  | Harald Ganzinger,
Jürgen Stuber:
Superposition with equivalence reasoning and delayed clause normal form transformation.
Inf. Comput. 199(1-2): 3-23 (2005) |
| 2004 |
| 11 |  | Manfred Schmidt-Schauß,
Jürgen Stuber:
The Complexity of Linear and Stratified Context Matching Problems.
Theory Comput. Syst. 37(6): 717-740 (2004) |
| 2003 |
| 10 |  | Harald Ganzinger,
Jürgen Stuber:
Superposition with Equivalence Reasoning and Delayed Clause Normal Form Transformation.
CADE 2003: 335-349 |
| 9 |  | Jürgen Stuber,
Mark van den Brand:
Extracting Mathematical Semantics from Documents.
PPSWR 2003: 160-173 |
| 2001 |
| 8 |  | Jürgen Stuber:
A Model-Based Completeness Proof of Extended Narrowing and Resolution.
IJCAR 2001: 195-210 |
| 2000 |
| 7 |  | Jürgen Stuber:
Deriving Theory Superposition Calculi from Convergent Term Rewriting Systems.
RTA 2000: 229-245 |
| 1999 |
| 6 |  | Jürgen Stuber:
Theory Path Orderings.
RTA 1999: 148-162 |
| 1998 |
| 5 |  | Jürgen Stuber:
Superposition Theorem Proving for Abelian Groups Represented as Integer Modules.
Theor. Comput. Sci. 208(1-2): 149-177 (1998) |
| 1996 |
| 4 |  | Jürgen Stuber:
Superposition Theorem Proving for Albelian Groups Represented as Integer Modules.
RTA 1996: 33-47 |
| 1994 |
| 3 |  | Leo Bachmair,
Harald Ganzinger,
Jürgen Stuber:
Combining Algebra and Universal Algebra in First-Order Theorem Proving: The Case of Commutative Rings.
COMPASS/ADT 1994: 1-29 |
| 2 |  | Jürgen Stuber:
Computing Stable Models by Program Transformation.
ICLP 1994: 58-73 |
| 1992 |
| 1 |  | Harald Ganzinger,
Jürgen Stuber:
Inductive Theorem Proving by Consistency for First-Order Clauses.
CTRS 1992: 226-241 |