scientific article; zbMATH DE number 1487842
From MaRDI portal
Publication:4494366
zbMath0953.68068MaRDI QIDQ4494366
Keiichirou Kusakari, Masaki Nakamura, Yoshihito Toyama
Publication date: 10 August 2000
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (20)
Relaxing monotonicity for innermost termination ⋮ On proving \(C_E\)-termination of rewriting by size-change termination ⋮ Mechanically proving termination using polynomial interpretations ⋮ Modular and incremental proofs of AC-termination ⋮ Polynomials over the reals in proofs of termination : from theory to practice ⋮ SAT solving for termination proofs with recursive path orders and dependency pairs ⋮ Paramodulation with non-monotonic orderings and simplification ⋮ Mechanizing and improving dependency pairs ⋮ Dependency Pairs for Rewriting with Built-In Numbers and Semantic Data Structures ⋮ Certifying a Termination Criterion Based on Graphs, without Graphs ⋮ Enhancing dependency pair method using strong computability in simply-typed term rewriting ⋮ Termination of narrowing via termination of rewriting ⋮ Context-sensitive dependency pairs ⋮ On Proving Termination of Constrained Term Rewrite Systems by Eliminating Edges from Dependency Graphs ⋮ Multi-dimensional interpretations for termination of term rewriting ⋮ Termination Analysis of Logic Programs Based on Dependency Graphs ⋮ The size-change principle and dependency pairs for termination of term rewriting ⋮ Modular and incremental automated termination proofs ⋮ Tuple interpretations for termination of term rewriting ⋮ Term orderings for non-reachability of (conditional) rewriting
This page was built for publication:
