Polynomial time termination and constraint satisfaction tests

DOI10.1007/978-3-662-21551-7_30zbMath1503.68147OpenAlexW1589342712MaRDI QIDQ5055810

David Alan Plaisted

Publication date: 9 December 2022

Published in: Rewriting Techniques and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-662-21551-7_30

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Grammars and rewriting systems (68Q42)

Related Items (9)

Solving simplification ordering constraints ⋮ Jumping and escaping: modular termination and the abstract path ordering ⋮ First-order theory of rewriting for linear variable-separated rewrite systems: automation, formalization, certification ⋮ Natural termination ⋮ Unnamed Item ⋮ On the longest perpetual reductions in orthogonal expression reduction systems ⋮ Perpetual reductions in \(\lambda\)-calculus ⋮ Algorithms and reductions for rewriting problems. II. ⋮ Perpetuality and uniform normalization in orthogonal rewrite systems

Cites Work

• Well-Quasi-Ordering, The Tree Theorem, and Vazsonyi's Conjecture
• Unnamed Item
• Unnamed Item

This page was built for publication: Polynomial time termination and constraint satisfaction tests