Termination of term rewriting using dependency pairs
type: Item
instance of: scholarly article
title: Termination of term rewriting using dependency pairs
zbMATH Open document ID: 0938.68051
DOI: 10.1016/S0304-3975(99)00207-8
author: Yanyan Li
published in: Theoretical Computer Science
publication date: 2000-06-04T00:00:00Z
Mathematics Subject Classification ID: 68Q42
zbMATH DE Number: 1454399
zbMATH Keywords: termination
zbMATH Keywords: term rewriting
zbMATH Keywords: dependency pairs
zbMATH Keywords: verification
zbMATH Keywords: automated theorem proving
describes a project that uses: REVE
MaRDI profile type: Publication
cites work: Termination by absence of infinite chains of dependency pairs
cites work: Proving innermost normalisation automatically
cites work: Termination of constructor systems
cites work: Q3783521
cites work: Termination by completion
cites work: Termination of rewriting systems by polynomial interpretations and its implementation
cites work: Proving termination of (conditional) rewrite systems. A semantic approach
cites work: Q4385535
cites work: Q3917482
cites work: Orderings for term-rewriting systems
cites work: Termination of rewriting
cites work: Natural termination
cites work: Q4385532
cites work: Automating the Knuth Bendix ordering
cites work: Q4537515
cites work: Dummy elimination: Making termination easier
cites work: Generating polynomial orderings for termination proofs
cites work: Termination of nested and mutually recursive algorithms
cites work: Pushing the frontiers of combining rewrite systems farther outwards
cites work: Q4846997
cites work: On proving termination by innermost termination
cites work: Q3883561
cites work: Q4023900
cites work: Q5581665
cites work: Modular proofs for completeness of hierarchical term rewriting systems
cites work: Rewriting techniques and applications. 9th international conference, RTA-98, Tsukuba, Japan, March 30 - April 1, 1998. Proceedings
cites work: Q4705617
cites work: Simple termination of rewrite systems
cites work: Generating polynomial orderings
cites work: Automatic termination proofs with transformation orderings
cites work: Q4846999
cites work: Counterexamples to termination for the direct sum of term rewriting systems
cites work: Termination of term rewriting: Interpretation and type elimination
cites work: Q4847000
full work available at URL: s0304-3975(99)00207-8
OpenAlex ID: W2090855107
description: scientific article; zbMATH DE number 1454399