Constant runtime complexity of term rewriting is semi-decidable.

Florian Frohn Jürgen Giesl

Published in: Inf. Process. Lett. (2018)

Keyphrases

term rewriting
theorem proving
theorem prover
operational semantics
knuth bendix
polynomial hierarchy
database
computational complexity
rewrite systems