Inductive Theorem Proving by Consistency for First-Order Clauses. - Harald Ganzinger; Jürgen Stuber (Informatik, 1992)

Inductive Theorem Proving by Consistency for First-Order Clauses. - Harald Ganzinger; Jürgen Stuber (CTRS, 1992)

Combining Algebra and Universal Algebra in First-Order Theorem Proving: The Case of Commutative Rings. - Leo Bachmair; Harald Ganzinger; Jürgen Stuber (COMPASS/ADT, 1994)

Computing Stable Models by Program Transformation. - Jürgen Stuber (ICLP, 1994)

Superposition Theorem Proving for Albelian Groups Represented as Integer Modules. - Jürgen Stuber (RTA, 1996)

Superposition Theorem Proving for Abelian Groups Represented as Integer Modules. - Jürgen Stuber (Theor. Comput. Sci., 1998)

Theory Path Orderings. - Jürgen Stuber (RTA, 1999)

Deriving Theory Superposition Calculi from Convergent Term Rewriting Systems. - Jürgen Stuber (RTA, 2000)

A Model-Based Completeness Proof of Extended Narrowing and Resolution. - Jürgen Stuber (IJCAR, 2001)

Extracting Mathematical Semantics from Documents. - Jürgen Stuber; Mark van den Brand (PPSWR, 2003)

The Complexity of Linear and Stratified Context Matching Problems. - Manfred Schmidt-Schauß; Jürgen Stuber (Theory Comput. Syst., 2004)

Superposition theorem proving for commutative algebraic theories. - Jürgen Stuber (2004)

Superposition with equivalence reasoning and delayed clause normal form transformation. - Harald Ganzinger; Jürgen Stuber (Inf. Comput., 2005)