An improved general path order

DOI10.1007/BF01293264MaRDI QIDQ1925013zbMATH OpenFDO

Authors Alfons Geser

Publication date 27 October 1996

Published in Applicable Algebra in Engineering, Communication and Computing (Search for Journal in Brave)

zbMATH Keywords

term rewriting systemsimproved general path order

Mathematics Subject Classification ID

Grammars and rewriting systems (68Q42)

Recommendations

• A Higher-Order Iterative Path Ordering
• Improving associative path orderings
• On recursive path ordering
• Recursive Path Orderings Can Also Be Incremental
• Certified Higher-Order Recursive Path Ordering
• Graph path orderings
• scientific article; zbMATH DE number 3921960
• Iterative Lexicographic Path Orders
• Publication:4938603
• Order preserving reductions and polynomial improving paths

Cites work

• scientific article; zbMATH DE number 3870584 (Why is no real title available?)
• scientific article; zbMATH DE number 4155899 (Why is no real title available?)
• scientific article; zbMATH DE number 3810909 (Why is no real title available?)
• scientific article; zbMATH DE number 3905845 (Why is no real title available?)
• scientific article; zbMATH DE number 4092758 (Why is no real title available?)
• scientific article; zbMATH DE number 8327 (Why is no real title available?)
• scientific article; zbMATH DE number 139989 (Why is no real title available?)
• scientific article; zbMATH DE number 794240 (Why is no real title available?)
• scientific article; zbMATH DE number 3299786 (Why is no real title available?)
• A note on simplification orderings
• An improved general path order
• Confluent Reductions: Abstract Properties and Applications to Term Rewriting Systems
• Counterexamples to termination for the direct sum of term rewriting systems
• Natural termination
• On the recursive decomposition ordering with lexicographical status and other related orderings
• Orderings for term-rewriting systems
• Path of subterms ordering and recursive decomposition ordering revisited
• Proving termination with multiset orderings
• Simulation of Turing machines by a regular rewrite rule
• Termination by completion
• Termination of rewriting

Cited in

(9)

• Improving associative path orderings
• An improved general path order
• A Higher-Order Iterative Path Ordering
• Jumping and escaping: modular termination and the abstract path ordering
• Termination of constructor systems
• scientific article; zbMATH DE number 5585075 (Why is no real title available?)
• Shallow confluence of conditional term rewriting systems
• Weighted Path Orders Are Semantic Path Orders
• Natural termination

This page was built for publication: An improved general path order

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1925013)