Lower Bounds for Runtime Complexity of Term Rewriting.

Florian Frohn Jürgen Giesl Jera Hensel Cornelius Aschermann Thomas Ströder

Published in: J. Autom. Reason. (2017)

Keyphrases

term rewriting
lower bound
worst case
upper bound
theorem proving
theorem prover
knuth bendix
rewrite systems
objective function
operational semantics
branch and bound
np hard
database
cooperative
branch and bound algorithm