License: Creative Commons Attribution-NonCommercial-NoDerivs 3.0 Unported license (CC BY-NC-ND 3.0)
When quoting this document, please refer to the following
DOI: 10.4230/LIPIcs.RTA.2011.71
URN: urn:nbn:de:0030-drops-31295
Go to the corresponding LIPIcs Volume Portal

Klein, Dominik ; Hirokawa, Nao

Maximal Completion

22.pdf (0.5 MB)


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.

BibTeX - Entry

  author =	{Dominik Klein and Nao Hirokawa},
  title =	{{Maximal Completion}},
  booktitle =	{22nd International Conference on Rewriting Techniques and Applications (RTA'11)},
  pages =	{71--80},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-939897-30-9 },
  ISSN =	{1868-8969},
  year =	{2011},
  volume =	{10},
  editor =	{Manfred Schmidt-Schau{\ss}},
  publisher =	{Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{},
  URN =		{urn:nbn:de:0030-drops-31295},
  doi =		{10.4230/LIPIcs.RTA.2011.71},
  annote =	{Keywords: Term Rewriting, Knuth-Bendix Completion, Multi-completion}

Keywords: Term Rewriting, Knuth-Bendix Completion, Multi-completion
Collection: 22nd International Conference on Rewriting Techniques and Applications (RTA'11)
Issue Date: 2011
Date of publication: 26.04.2011

DROPS-Home | Fulltext Search | Imprint | Privacy Published by LZI