Equational termination by semantic labelling

DOI10.1007/3-540-44622-2_31MaRDI QIDQ2753692zbMATH OpenFDO

Authors Hitoshi Ohsaki, Aart Middeldorp, Jürgen Giesl

Publication date 11 November 2001

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/3-540-44622-2_31

Mathematics Subject Classification ID

Grammars and rewriting systems (68Q42)

Recommendations

• scientific article; zbMATH DE number 794240
• Dummy elimination in equational rewriting
• Innermost termination of rewrite systems by labeling
• Modular and certified semantic labeling and unlabeling
• Transforming termination by self-labelling

Cited in

(12)

• Predictive Labeling
• Semantic labelling for proving termination of combinatory reduction systems
• Automation of Recursive Path Ordering for Infinite Labelled Rewrite Systems
• Termination Modulo Combinations of Equational Theories
• Transforming termination by self-labelling
• scientific article; zbMATH DE number 794240 (Why is no real title available?)
• Dummy elimination in equational rewriting
• Modular and certified semantic labeling and unlabeling
• An universal termination condition for solving goals in equational languages
• Simulating dependency pairs by semantic labeling
• Hydra battles and AC termination
• Elimination transformations for associative-commutative rewriting systems

This page was built for publication: Equational termination by semantic labelling

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