It is Undecidable Whether the Knuth-Bendix Completion Procedure Generates a Crossed Pair.

Paliath Narendran Jonathan Stillman

Published in: STACS (1989)

Keyphrases

knuth bendix
term rewriting
rewrite systems
function symbols
theorem proving
artificial intelligence
general purpose
np complete