4 citations · 8 across the 3 of their papers we have counts for
3 papers
cs.LO2011★ 4 cited
Uncurrying for Innermost Termination and Derivational Complexity
Harald Zankl, Nao Hirokawa, Aart Middeldorp
First-order applicative term rewriting systems provide a natural framework for modeling higher-order aspects. In earlier work we introduced an uncurrying transformation which is te…
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…