Maximal Completion

@inproceedings{Klein2011MaximalC,
  title={Maximal Completion},
  author={Dominik Klein and Nao Hirokawa},
  booktitle={RTA},
  year={2011}
}
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