Natural termination
type: Item
instance of: scholarly article
title: Natural termination
zbMATH Open document ID: 0873.68103
DOI: 10.1016/0304-3975(94)00275-4
author: Nachum Dershowitz
author: Charles Hoot
published in: Theoretical Computer Science
publication date: 1997-02-28T00:00:00Z
Mathematics Subject Classification ID: 68Q42
zbMATH DE Number: 985667
zbMATH Keywords: termination of rewrite systems
describes a project that uses: REVE
MaRDI profile type: Publication
full work available at URL: 0304-3975(94)00275-4
OpenAlex ID: W2913116145
cites work: Equational inference, canonical proofs, and proof orderings
cites work: Proving Properties of Programs by Structural Induction
cites work: Termination of rewriting systems by polynomial interpretations and its implementation
cites work: Q3917482
cites work: Orderings for term-rewriting systems
cites work: Termination of rewriting
cites work: Topics in termination
cites work: Q4385532
cites work: Proving termination with multiset orderings
cites work: An improved general path order
cites work: Q4255514
cites work: Q4023900
cites work: Q5581665
cites work: On the recursive decomposition ordering with lexicographical status and other related orderings
cites work: Q4195948
cites work: Q4124327
cites work: A geometrical approach to multiset orderings
cites work: On theories with a combinatorial definition of 'equivalence'
cites work: Computing in systems described by equations
cites work: Polynomial time termination and constraint satisfaction tests
cites work: Q3817651
cites work: Q4846999
cites work: Q4847000
description: scientific article; zbMATH DE number 985667