Analyzing Innermost Runtime Complexity of Term Rewriting by Dependency Pairs.

Lars Noschinski Fabian Emmes Jürgen Giesl

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

Keyphrases

term rewriting
theorem proving
theorem prover
worst case
pairwise
operational semantics
computational complexity
decision problems
rewrite systems
knuth bendix
database
graphical models
expert systems
mobile robot
computational cost
dependency relations