17 citations · 51 across the 10 of their papers we have counts for
Showing cs.SCShow all
2 papers · 1 filter
cs.SC2006
Satisfying KBO Constraints
Harald Zankl, Aart Middeldorp
This paper presents two new approaches to prove termination of rewrite systems with the Knuth-Bendix order efficiently. The constraints for the weight function and for the preceden…
cs.SC2006★ 4 cited
SAT Techniques for Lexicographic Path Orders
Harald Zankl
This seminar report is concerned with expressing LPO-termination of term rewrite systems as a satisfiability problem in propositional logic. After relevant algorithms are explained…