| Proving almost-sure innermost termination of probabilistic term rewriting using dependency pairs JC Kassing, J Giesl International Conference on Automated Deduction, 344-364, 2023 | 8 | 2023 |
| Proving almost-sure innermost termination of probabilistic term rewriting using dependency pairs. CoRR abs/2305.11741 (2023) JC Kassing, J Giesl | 5 | |
| A Complete Dependency Pair Framework for Almost-Sure Innermost Termination of Probabilistic Term Rewriting JC Kassing, S Dollase, J Giesl International Symposium on Functional and Logic Programming, 62-80, 2024 | 4 | 2024 |
| From innermost to full almost-sure termination of probabilistic term rewriting JC Kassing, F Frohn, J Giesl International Conference on Foundations of Software Science and Computation …, 2024 | 3 | 2024 |
| A dependency pair framework for relative termination of term rewriting JC Kassing, G Vartanyan, J Giesl International Joint Conference on Automated Reasoning, 360-380, 2024 | 1 | 2024 |
| Using dependency pairs for proving almost-sure termination of probabilistic term rewriting JC Kassing MA thesis. RWTH Aachen University, 2022 | 1 | 2022 |
| From Innermost to Full Probabilistic Term Rewriting: Almost-Sure Termination, Complexity, and Modularity JC Kassing, J Giesl arXiv preprint arXiv:2409.17714, 2024 | | 2024 |
| Annotated Dependency Pairs for Full Almost-Sure Termination of Probabilistic Term Rewriting JC Kassing, J Giesl arXiv preprint arXiv:2408.06768, 2024 | | 2024 |
| Dependency Tuples for Almost-Sure Innermost Termination of Probabilistic Term Rewriting (Short WST Version) JC Kassing, J Giesl arXiv preprint arXiv:2307.10002, 2023 | | 2023 |
Jürgen GieslProfessor of Computer Science, RWTH Aachen University在 informatik.rwth-aachen.de 的电子邮件经过验证
