scientific article; zbMATH DE number 1487842
From MaRDI portal
Publication:4494366
zbMATH Open0953.68068MaRDI QIDQ4494366FDOQ4494366
Authors: Keiichirou Kusakari, Masaki Nakamura, Yoshihito Toyama 
Publication date: 10 August 2000
Title of this publication is not available (Why is that?)
Recommendations
Cited In (23)
- Tuple interpretations for termination of term rewriting
- Multi-dimensional interpretations for termination of term rewriting
- On proving \(C_E\)-termination of rewriting by size-change termination
- Relaxing monotonicity for innermost termination
- Constraints for Argument Filterings
- Term orderings for non-reachability of (conditional) rewriting
- Enhancing dependency pair method using strong computability in simply-typed term rewriting
- Termination of narrowing via termination of rewriting
- Title not available (Why is that?)
- Polynomials over the reals in proofs of termination : from theory to practice
- Argument filterings and usable rules for simply typed dependency pairs
- Certifying a Termination Criterion Based on Graphs, without Graphs
- Dependency Pairs for Rewriting with Built-In Numbers and Semantic Data Structures
- Mechanically proving termination using polynomial interpretations
- SAT solving for termination proofs with recursive path orders and dependency pairs
- Modular and incremental automated termination proofs
- Paramodulation with non-monotonic orderings and simplification
- Mechanizing and improving dependency pairs
- The size-change principle and dependency pairs for termination of term rewriting
- Modular and incremental proofs of AC-termination
- Context-sensitive dependency pairs
- Termination Analysis of Logic Programs Based on Dependency Graphs
- On proving termination of constrained term rewrite systems by eliminating edges from dependency graphs
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 Q4494366)
