Sciweavers

Share
RTA
2011
Springer
8 years 9 months ago
Maximal Completion
Given an equational system, completion procedures compute an equivalent and complete (terminating and confluent) term rewrite system. We present a very simple and efficient compl...
Dominik Klein, Nao Hirokawa
CTRS
1990
9 years 11 months ago
Completion Procedures as Semidecision Procedures
Completion procedures, originated from the seminal work of Knuth and Bendix, are wellknown as procedures for generating confluent rewrite systems, i.e. decision procedures for al ...
Maria Paola Bonacina, Jieh Hsiang
books