Login / Signup

A Complete Proof of Correctness of the Knuth-Bendix Completion Algorithm.

Gérard P. Huet
Published in: J. Comput. Syst. Sci. (1981)
Keyphrases
  • np hard
  • provably correct
  • knuth bendix
  • search space
  • information systems
  • machine learning
  • object oriented
  • constraint satisfaction problems
  • functional dependencies