scientific article; zbMATH DE number 794237
From MaRDI portal
zbMath0839.68047MaRDI QIDQ4846997
Publication date: 10 June 1996
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items
Harnessing First Order Termination Provers Using Higher Order Dependency Pairs, Mechanizing and improving dependency pairs, Modularity in term rewriting revisited, Decidability for left-linear growing term rewriting systems., Formalizing Soundness and Completeness of Unravelings, Deciding Innermost Loops, Termination of term rewriting using dependency pairs, On termination and confluence properties of disjoint and constructor-sharing conditional rewrite systems, Automating the dependency pair method, Termination Analysis by Dependency Pairs and Inductive Theorem Proving, Applications and extensions of context-sensitive rewriting, Proving Confluence of Term Rewriting Systems Automatically, Conditions for confluence of innermost terminating term rewriting systems, Some characteristics of strong innermost normalization, Hierarchical termination revisited., Modular and incremental automated termination proofs, Modular termination proofs for rewriting using dependency pairs, Termination by absence of infinite chains of dependency pairs
