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.

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
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
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
Annotated Dependency Pairs for Full Almost-Sure Termination of Probabilistic Term Rewriting
2024 Lecture notes in computer science conference-paper Computer Science Logic, programming, and type systems

Jan-Christoph Kassing, 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
2024 Lecture notes in computer science conference-paper Computer Science Logic, programming, and type systems

Jan-Christoph Kassing, Stefan Dollase, Jürgen Giesl

2

citations
A Supervised BERT Model for Identifying Core-Intent Bearing Phrases in e-Commerce Queries
2024 ACM International Conference on Information and Knowledge Management (CIKM) conference-paper Computer Science Information Retrieval and Search Behavior

Abhishek Sudhakar Deshmukh, Arnab Dutta

0

citations

9 results