A
Menu
January 01, 2025 article Open access Aachen paper

From Innermost to Full Probabilistic Term Rewriting: Almost-Sure Termination, Complexity, and Modularity

Logical Methods in Computer Science

DOI: 10.18154/rwth-2026-00080 Full text (OA) OpenAlex

Authors 2

  1. Jan-Christoph Kassing Aachen

    RWTH Aachen University

    Affiliation as printed

    RWTH Aachen

  2. Jürgen Giesl Aachen

    RWTH Aachen University

    Affiliation as printed

    RWTH Aachen

Cited by 0 stored of 0

No patents citing this paper on Lens.org (checked 2026-10-06).

References 0