📣 Help Shape the Future of UKRI's Gateway to Research (GtR)

We're improving UKRI's Gateway to Research and are seeking your input! If you would be interested in being interviewed about the improvements we're making and to have your say about how we can make GtR more user-friendly, impactful, and effective for the Research and Innovation community, please email gateway@ukri.org.

Proving Almost-Sure Innermost Termination of Probabilistic Term Rewriting Using Dependency Pairs

First Author: Kassing J

Attributed to: VeTSpec: Verified Trustworthy Software Specification funded by SPF

Abstract

No abstract provided

Bibliographic Information

Digital Object Identifier: http://dx.doi.org/10.1007/978-3-031-38499-8_20

Publication URI: http://dx.doi.org/10.1007/978-3-031-38499-8_20

Type: Book Chapter

Book Title: Automated Deduction - CADE 29 - 29th International Conference on Automated Deduction, Rome, Italy, July 1-4, 2023, Proceedings (2023)

Page Reference: 344-364

ISSN: 16113349 03029743