A Critical Pair Criterion for Level-Commutation of Conditional Term Rewriting Systems

DOI10.1007/978-3-031-43369-6_6MaRDI QIDQ6496624zbMATH OpenFDO

Authors Takahito Aoto

Publication date 3 May 2024

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.1007/978-3-031-43369-6_6

Mathematics Subject Classification ID

Artificial intelligence (68Txx)

Recommendations

• Sufficient conditions for modular termination of conditional term rewriting systems
• Level-confluence of conditional rewrite systems with extra variables in right-hand sides
• Confluence of terminating conditional rewrite systems revisited
• scientific article; zbMATH DE number 4090848
• scientific article; zbMATH DE number 4092758

Cites work

• Automated proofs of unique normal forms w.r.t. conversion for term rewriting systems
• Automatically Proving and Disproving Feasibility Conditions
• Conditional confluence (system description)
• Confluence without termination via parallel critical pairs
• Confluent Reductions: Abstract Properties and Applications to Term Rewriting Systems
• scientific article; zbMATH DE number 1729952 (Why is no real title available?)
• scientific article; zbMATH DE number 4106267 (Why is no real title available?)
• scientific article; zbMATH DE number 1889386 (Why is no real title available?)
• Level-confluence of conditional rewrite systems with extra variables in right-hand sides
• Logicality of conditional rewrite systems
• Proving Confluence of Term Rewriting Systems Automatically
• Shallow confluence of conditional term rewriting systems
• Term Rewriting and All That

This page was built for publication: A Critical Pair Criterion for Level-Commutation of Conditional Term Rewriting Systems

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