Satisfying KBO Constraints

DOI10.1007/978-3-540-73449-9_29zbMath1203.68080OpenAlexW1551444597MaRDI QIDQ5432353

Harald Zankl, Aart Middeldorp

Publication date: 2 January 2008

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

Full work available at URL: https://doi.org/10.1007/978-3-540-73449-9_29

Mathematics Subject Classification ID

Grammars and rewriting systems (68Q42)

Related Items (4)

KBO orientability ⋮ Complexity Analysis by Rewriting ⋮ Transforming SAT into Termination of Rewriting ⋮ Proving Termination with (Boolean) Satisfaction

This page was built for publication: Satisfying KBO Constraints