Confluence Criteria for Logically Constrained Rewrite Systems

DOI10.1007/978-3-031-38499-8_27MaRDI QIDQ6492763

Aart Middeldorp, Jonas Schöpf

Publication date: 26 April 2024

Mathematics Subject Classification ID

Mechanization of proofs and logical operations (03B35) Theorem proving (automated and interactive theorem provers, deduction, resolution, etc.) (68V15)

Cites Work

• Unnamed Item
• Unnamed Item
• A coinductive approach to proving reachability properties in logically constrained term rewriting systems
• Runtime complexity analysis of logically constrained rewriting
• Certification of Classical Confluence Results for Left-Linear Term Rewrite Systems
• Term Rewriting with Logical Constraints
• Constrained Term Rewriting tooL
• Confluent Reductions: Abstract Properties and Applications to Term Rewriting Systems
• Term Rewriting and All That
• Verifying Procedural Programs via Constrained Rewriting Induction

This page was built for publication: Confluence Criteria for Logically Constrained Rewrite Systems