Solving Partial Order Constraints for LPO Termination

DOI10.1007/11805618_2zbMath1151.68631arXivcs/0512067OpenAlexW2171453216MaRDI QIDQ3527280

Michael Codish, Peter J. Stuckey, V. Lagoon

Publication date: 25 September 2008

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

Full work available at URL: https://arxiv.org/abs/cs/0512067

Mathematics Subject Classification ID

Grammars and rewriting systems (68Q42)

Related Items (8)

KBO orientability ⋮ Decreasing diagrams and relative termination ⋮ Decreasing Diagrams and Relative Termination ⋮ A SAT-Based Approach to Size Change Termination with Global Ranking Functions ⋮ Transforming SAT into Termination of Rewriting ⋮ Argument Filterings and Usable Rules for Simply Typed Dependency Pairs ⋮ Proving Termination with (Boolean) Satisfaction ⋮ Proving Termination of Context-Sensitive Rewriting with MU-TERM

This page was built for publication: Solving Partial Order Constraints for LPO Termination