scientific article; zbMATH DE number 1765702
From MaRDI portal
zbMath0988.68162MaRDI QIDQ4539643
Publication date: 10 July 2002
Full work available at URL: http://link.springer.de/link/service/series/0558/bibs/2083/20830593
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items
Mechanically proving termination using polynomial interpretations, Elimination transformations for associative-commutative rewriting systems, Mechanizing and improving dependency pairs, First-order theory of rewriting for linear variable-separated rewrite systems: automation, formalization, certification, Match-Bounds with Dependency Pairs for Proving Termination of Rewrite Systems, Enhancing dependency pair method using strong computability in simply-typed term rewriting, Use of logical models for proving infeasibility in term rewriting, Decidable call-by-need computations in term rewriting, Automating the dependency pair method, Beyond Dependency Graphs, Context-sensitive dependency pairs, Proving semantic properties as first-order satisfiability, Match-bounds revisited, Deciding \(\mathcal H_1\) by resolution, Hierarchical termination revisited., Modular and incremental automated termination proofs, Term orderings for non-reachability of (conditional) rewriting, Modular termination proofs for rewriting using dependency pairs
