From

Institution

Field

Type

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

Reset

Papers matching “term rewriting” 9

Sort: Relevance Cited Newest Oldest Fwci Patents ⇩ CSV

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

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 arXiv (Cornell University) preprint 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
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
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

9 results