Sciweavers

Share
RTA
2011
Springer

Maximal Completion

7 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 completion procedure, which is based on MaxSAT solving. Experiments show that the procedure is comparable to recent powerful completion tools. 1998 ACM Subject Classification F.4.2 Grammars and Other Rewriting Systems Keywords and phrases Term Rewriting, Knuth-Bendix Completion, Multi-completion Digital Object Identifier 10.4230/LIPIcs.xxx.yyy.p Category System Description
Dominik Klein, Nao Hirokawa
Added 17 Sep 2011
Updated 17 Sep 2011
Type Journal
Year 2011
Where RTA
Authors Dominik Klein, Nao Hirokawa
Comments (0)
books