Login / Signup
Simplifying termination proofs for rewrite systems by preprocessing.
Bernhard Gramlich
Published in:
PPDP (2000)
Keyphrases
</>
rewrite systems
preprocessing
term rewriting
theorem prover
theorem proving
quantifier free
knuth bendix
active rules
first order logic
feature extraction
information systems
software development
operational semantics