scientific article; zbMATH DE number 794237
From MaRDI portal
Publication:4846997
zbMATH Open0839.68047MaRDI QIDQ4846997FDOQ4846997
Authors: Bernhard Gramlich 
Publication date: 10 June 1996
Title of this publication is not available (Why is that?)
Recommendations
- scientific article; zbMATH DE number 1761895
- On the modularity of termination of term rewriting systems
- Generalized sufficient conditions for modular termination of rewriting
- Completeness of combinations of constructor systems
- On termination and confluence properties of disjoint and constructor-sharing conditional rewrite systems
Cited In (24)
- Modularity in term rewriting revisited
- Harnessing first order termination provers using higher order dependency pairs
- Automating the dependency pair method
- Termination Analysis by Dependency Pairs and Inductive Theorem Proving
- Hierarchical termination revisited.
- Formalizing soundness and completeness of unravelings
- Conditions for confluence of innermost terminating term rewriting systems
- On termination and confluence properties of disjoint and constructor-sharing conditional rewrite systems
- Termination by absence of infinite chains of dependency pairs
- Applications and extensions of context-sensitive rewriting
- Deciding Innermost Loops
- Modular termination proofs for rewriting using dependency pairs
- Termination of term rewriting using dependency pairs
- From innermost to full almost-sure termination of probabilistic term rewriting
- Modular and incremental automated termination proofs
- Finite canonical rewriting systems for congruences generated by concurrency relations
- Overlap closures do not suffice for termination of general term rewriting systems
- Decidability for left-linear growing term rewriting systems.
- Title not available (Why is that?)
- Mechanizing and improving dependency pairs
- Intersection of the reflexive transitive closures of two rewrite relations induced by term rewriting systems
- Some characteristics of strong innermost normalization
- Relating confluence, innermost-confluence and outermost-confluence properties of term rewriting system
- Proving Confluence of Term Rewriting Systems Automatically
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4846997)
