Weighted rewriting

DOI10.1007/978-3-032-04167-8_11MaRDI QIDQ6852313zbMATH OpenFDO

Authors Martin Avanzini, Akihisa Yamada

Publication date 26 February 2026

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.1007/978-3-032-04167-8_11

Mathematics Subject Classification ID

Grammars and rewriting systems (68Q42) Logic in artificial intelligence (68T27) Theorem proving (automated and interactive theorem provers, deduction, resolution, etc.) (68V15)

Cites work

• Complexity analysis for term rewriting by integer transition systems
• scientific article; zbMATH DE number 6792365 (Why is no real title available?)
• scientific article; zbMATH DE number 7730636 (Why is no real title available?)
• Lightweight semiformal time complexity analysis for purely functional data structures
• Logical Approaches to Computational Barriers
• On probabilistic term rewriting
• Probabilistic rewriting and asymptotic behaviour: on termination and unique normal forms
• Quantitative analysis of weighted transition systems
• Quantum expectation transformers for cost analysis
• Term Rewriting and Applications
• Termination of nondeterministic probabilistic programs
• Weighted automata
• Weighted relational models of typed lambda-calculi

This page was built for publication: Weighted rewriting

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6852313)