A Critical Pair Criterion for Level-Commutation of Conditional Term Rewriting Systems
From MaRDI portal
Publication:6496624
DOI10.1007/978-3-031-43369-6_6MaRDI QIDQ6496624
Unnamed Author, Takahito Aoto, Unnamed Author
Publication date: 3 May 2024
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Logicality of conditional rewrite systems
- Automated proofs of unique normal forms w.r.t. conversion for term rewriting systems
- Shallow confluence of conditional term rewriting systems
- Proving Confluence of Term Rewriting Systems Automatically
- Confluent Reductions: Abstract Properties and Applications to Term Rewriting Systems
- Term Rewriting and All That
- Automatically Proving and Disproving Feasibility Conditions
- Level-confluence of conditional rewrite systems with extra variables in right-hand sides
- Conditional Confluence (System Description)
- Confluence without termination via parallel critical pairs
This page was built for publication: A Critical Pair Criterion for Level-Commutation of Conditional Term Rewriting Systems
