From

Institution

Field

Type

Open access only Cited by patents (Lens) Include non-Aachen papers (citing/cited)

Reset

Papers matching “term rewriting” 21

Sort: Relevance Cited Newest Oldest Fwci Patents ⇩ CSV

Not finding it? Sign in to also search OpenAlex live.

Small Term Reachability and Related Problems for Terminating Term Rewriting Systems
2025 Logical Methods in Computer Science article Computer Science Logic, programming, and type systems Open access

Franz Baader, Jürgen Giesl

0

citations
From Innermost to Full Almost-Sure Termination of Probabilistic Term Rewriting
2024 Lecture notes in computer science conference-paper Computer Science Logic, programming, and type systems Open access

Jan-Christoph Kassing, Florian Frohn, Jürgen Giesl

2

citations
Dependency Pairs for Expected Innermost Runtime Complexity and Strong Almost-Sure Termination of Probabilistic Term Rewriting
2025 International Symposium on Principles and Practice of Declarative Programming (PPDP) conference-paper Computer Science Logic, programming, and type systems Open access

2

citations
Annotated Dependency Pairs for Full Almost-Sure Termination of Probabilistic Term Rewriting
2024 arXiv (Cornell University) preprint Computer Science Logic, programming, and type systems Open access

Jan-Christoph Kassing, Jürgen Giesl

1

citations
The Annotated Dependency Pair Framework for Almost-Sure Termination of Probabilistic Term Rewriting
2024 arXiv (Cornell University) preprint Computer Science Logic, programming, and type systems Open access

Jan-Christoph Kassing, Jürgen Giesl

0

citations
A Dependency Pair Framework for Relative Termination of Term Rewriting
2024 Lecture notes in computer science conference-paper Computer Science Logic, programming, and type systems Open access

Jan-Christoph Kassing, Jürgen Giesl

2

citations
A Dependency Pair Framework for Relative Termination of Term Rewriting
2024 arXiv (Cornell University) preprint Computer Science Logic, programming, and type systems Open access

Jan-Christoph Kassing, Jürgen Giesl

1

citations
Proving Almost-Sure Innermost Termination of Probabilistic Term Rewriting Using Dependency Pairs
2023 Lecture notes in computer science conference-paper Computer Science Logic, programming, and type systems Open access

Jan-Christoph Kassing, Jürgen Giesl

7

citations
Proving Almost-Sure Innermost Termination of Probabilistic Term Rewriting Using Dependency Pairs
2023 RWTH Publications (RWTH Aachen) conference-paper Computer Science Logic, programming, and type systems Open access

Jan-Christoph Kassing, Jürgen Giesl

1

citations
Dependency Tuples for Almost-Sure Innermost Termination of Probabilistic Term Rewriting (Short WST Version)
2023 arXiv (Cornell University) preprint Computer Science Logic, programming, and type systems Open access

Jan-Christoph Kassing, Jürgen Giesl

0

citations
The annotated dependency pair framework for almost-sure termination of probabilistic term rewriting
2026 Science of Computer Programming article Computer Science Logic, programming, and type systems Open access

Jan-Christoph Kassing, Jürgen Giesl

0

citations
From Innermost to Full Probabilistic Term Rewriting: Almost-Sure Termination, Complexity, and Modularity
2025 Logical Methods in Computer Science article Computer Science Logic, programming, and type systems Open access

Jan-Christoph Kassing, Jürgen Giesl

0

citations
From Innermost to Full Almost-Sure Termination of Probabilistic Term Rewriting
2023 arXiv (Cornell University) preprint Computer Science Logic, programming, and type systems Open access

Jan-Christoph Kassing, Florian Frohn, Jürgen Giesl

2

citations
From Innermost to Full Probabilistic Term Rewriting: Almost-Sure Termination, Complexity, and Modularity
2024 arXiv (Cornell University) preprint Computer Science Logic, programming, and type systems Open access

Jan-Christoph Kassing, Jürgen Giesl

1

citations
Disproving (Positive) Almost-Sure Termination of Probabilistic Term Rewriting via Random Walks
2026 arXiv (Cornell University) preprint Computer Science Logic, programming, and type systems Open access

Jan-Christoph Kassing, Henri Nagel, Alexander Schlecht, Jürgen Giesl

1

citations
Disproving (Positive) Almost-Sure Termination of Probabilistic Term Rewriting via Random Walks
2026 arXiv (Cornell University) preprint Computer Science Logic, programming, and type systems Open access

Jan-Christoph Kassing, Henri Nagel, Alexander Schlecht, Jürgen Giesl

0

citations
Disproving (Positive) Almost-Sure Termination of Probabilistic Term Rewriting via Random Walks
2026 Lecture notes in computer science conference-paper Computer Science Logic, programming, and type systems Open access

Jan-Christoph Kassing, Henri Nagel, A. Schlecht, Jürgen Giesl

0

citations
A Complete Dependency Pair Framework for Almost-Sure Innermost Termination of Probabilistic Term Rewriting
2023 arXiv (Cornell University) preprint Computer Science Logic, programming, and type systems Open access

Jan-Christoph Kassing

3

citations
Disproving (Positive) Almost-Sure Termination of Probabilistic Term Rewriting via Random Walks
2026 RWTH Publications (RWTH Aachen) book-chapter Computer Science Logic, programming, and type systems Open access

Jan-Christoph Kassing, Henri Nagel, A. Schlecht, Jürgen Giesl

0

citations
Weighted Rewriting: Semiring Semantics for Abstract Reduction Systems
2025 RWTH Publications (RWTH Aachen) article Computer Science Logic, programming, and type systems Open access

0

citations
EXCELLERATP2 D3.2 First Updated Report on Exa-Enabling Methodologies
2026 Zenodo (CERN European Organization for Nuclear Research) article Computer Science Parallel Computing and Optimization Techniques Open access

Ansgar Niemöller, Matthias H. Meinke, Joeffrey Legaux, Mohamed Ibrahim Ghenai, Michael Wagner, Tufan Arslan, +12 more

0

citations

21 results