An improved general path order
type: Item
instance of: scholarly article
title: An improved general path order
zbMATH Open document ID: 0858.68049
DOI: 10.1007/BF01293264
author: Alfons Geser
published in: Applicable Algebra in Engineering, Communication and Computing
publication date: 1996-10-27T00:00:00Z
Mathematics Subject Classification ID: 68Q42
zbMATH DE Number: 938654
zbMATH Keywords: term rewriting systems
zbMATH Keywords: improved general path order
MaRDI profile type: Publication
cites work: Q3484358
cites work: Termination by completion
cites work: Simulation of Turing machines by a regular rewrite rule
cites work: A note on simplification orderings
cites work: Orderings for term-rewriting systems
cites work: Termination of rewriting
cites work: Natural termination
cites work: Q3970984
cites work: Proving termination with multiset orderings
cites work: Q3819993
cites work: Q4028349
cites work: Confluent Reductions: Abstract Properties and Applications to Term Rewriting Systems
cites work: Q3659124
cites work: Q3683533
cites work: Q5581665
cites work: Q3336681
cites work: On the recursive decomposition ordering with lexicographical status and other related orderings
cites work: Path of subterms ordering and recursive decomposition ordering revisited
cites work: Counterexamples to termination for the direct sum of term rewriting systems
cites work: Q4847000
Recommended article: A Higher-Order Iterative Path Ordering
Recommended article: Improving associative path orderings
Recommended article: On recursive path ordering
Recommended article: Recursive Path Orderings Can Also Be Incremental
Recommended article: Certified Higher-Order Recursive Path Ordering
Recommended article: Graph Path Orderings
Recommended article: Q3696500
Recommended article: Iterative Lexicographic Path Orders
Recommended article: Q4938603
Recommended article: Order preserving reductions and polynomial improving paths
description: scientific article; zbMATH DE number 938654