Match-Bounds with Dependency Pairs for Proving Termination of Rewrite Systems.

Martin Korp Aart Middeldorp

Published in: LATA (2008)

Keyphrases

rewrite systems
term rewriting
term rewrite systems
quantifier free
active rules
knuth bendix
theorem proving
theorem prover
active databases
operational semantics
artificial intelligence
relational databases
knowledge representation
software development