Conditions for confluence of innermost terminating term rewriting systems
From MaRDI portal
Publication:2321950
DOI10.1007/S00200-018-0377-8zbMATH Open1429.68088OpenAlexW2907092888WikidataQ128639527 ScholiaQ128639527MaRDI QIDQ2321950FDOQ2321950
Masahiko Sakai, Michio Oyamaguchi, Sayaka Ishizuki
Publication date: 27 August 2019
Published in: Applicable Algebra in Engineering, Communication and Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00200-018-0377-8
Cites Work
- Analyzing program termination and complexity automatically with \textsf{AProVE}
- The Confluence Problem for Flat TRSs
- Proving Confluence of Term Rewriting Systems Automatically
- CSI – A Confluence Tool
- Term-rewriting systems with rule priorities
- Proving Confluence of Term Rewriting Systems via Persistency and Decreasing Diagrams
- Non-E-Overlapping, Weakly Shallow, and Non-Collapsing TRSs are Confluent
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
Cited In (4)
Uses Software
Recommendations
- Some results on the confluence property of combined term rewriting systems 👍 👎
- Confluence of terminating conditional rewrite systems revisited 👍 👎
- Confluence of the disjoint union of conditional term rewriting systems 👍 👎
- Confluence of nearly orthogonal infinitary term rewriting systems 👍 👎
- Relating confluence, innermost-confluence and outermost-confluence properties of term rewriting system 👍 👎
- Termination and confluence in infinitary term rewriting 👍 👎
- Title not available (Why is that?) 👍 👎
- Title not available (Why is that?) 👍 👎
- Title not available (Why is that?) 👍 👎
- Title not available (Why is that?) 👍 👎
This page was built for publication: Conditions for confluence of innermost terminating term rewriting systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2321950)
