Confluence of almost parallel-closed generalized term rewriting systems
From MaRDI portal
Cites work
- A Machine-Oriented Logic Based on the Resolution Principle
- All about Maude -- a high-performance logical framework. How to specify, program and verify systems in rewriting logic. With CD-ROM.
- Applications and extensions of context-sensitive rewriting
- Automatic generation of logical models with AGES
- Automatically Proving and Disproving Feasibility Conditions
- Certifying confluence of almost orthogonal CTRSs via exact tree automata completion
- Completeness results for basic narrowing
- Compositional confluence criteria
- Conditional rewrite rules
- Confluence by critical pair analysis revisited
- Confluence of layered rewrite systems
- Confluence of logically constrained rewrite systems revisited
- Confluence without termination via parallel critical pairs
- Confluent Reductions: Abstract Properties and Applications to Term Rewriting Systems
- Developing developments
- scientific article; zbMATH DE number 1729952 (Why is no real title available?)
- scientific article; zbMATH DE number 4090848 (Why is no real title available?)
- scientific article; zbMATH DE number 4106267 (Why is no real title available?)
- scientific article; zbMATH DE number 1257634 (Why is no real title available?)
- scientific article; zbMATH DE number 837700 (Why is no real title available?)
- scientific article; zbMATH DE number 3299786 (Why is no real title available?)
- Level-confluence of conditional rewrite systems with extra variables in right-hand sides
- Local confluence of conditional and generalized term rewriting systems
- Proving confluence in the confluence framework with confident
- Termination of generalized term rewriting systems
This page was built for publication: Confluence of almost parallel-closed generalized term rewriting systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6869954)