[Lecture Notes in Computer Science] Term Rewriting and Applications Volume 3467 || Confluent Term Rewriting SystemsGiesl, Jürgen · 2005

[Lecture Notes in Computer Science] Term Rewriting and Applications Volume 3467 || Partial Inversion of Constructor Term Rewriting SystemsGiesl, Jürgen · 2005

[Lecture Notes in Computer Science] Conditional Term Rewriting Systems Volume 308 || A logic for conditional term rewriting systemsKaplan, S.; Jouannaud, J. -P. · 1988

[Lecture Notes in Computer Science] Rewriting Techniques and Applications Volume 202 || Fairness in term rewriting systemsJouannaud, Jean-Pierre · 1985

[Lecture Notes in Computer Science] Term Rewriting and Applications Volume 3467 || Localized Fairness: A Rewriting SemanticsGiesl, Jürgen · 2005

[Lecture Notes in Computer Science] Category Theory and Computer Science Volume 1290 || Monads and modular term rewritingMoggi, Eugenio; Rosolini, Giuseppe · 1997

[Lecture Notes in Computer Science] Computer Science Logic Volume 626 || Proving termination for term rewriting systemsBörger, Egon; Jäger, Gerhard; Kleine Büning, Hans; Richter, Michael M. · 1992

[Lecture Notes in Computer Science] Term Rewriting and Applications Volume 3467 || Abstract ModularityGiesl, Jürgen · 2005

Approximating the domains of functional and imperative programsJürgen Brauburger; Jürgen Giesl · 1999

Deaccumulation techniques for improving provabilityJürgen Giesl; Armin Kühnemann; Janis Voigtländer · 2007

PrefaceJürgen Giesl · 2008

Simulating Liveness by Reduction StrategiesJürgen Giesl; Hans Zantema · 2003

Special Issue “Termination”Jürgen Giesl; Pierre Lescanne · Applicable Algebra in Engineering, Communication and Computing · 2001

PrefaceJürgen Giesl; Deepak Kapur · 2005

Special Issue on Automated DeductionJürgen Giesl · 2010

Current Trends in Automated DeductionJürgen Giesl · 2010