License
when quoting this document, please refer to the following
DOI:
URN: urn:nbn:de:0030-drops-31295
URL:

;

Maximal Completion

pdf-format:


Abstract

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

@InProceedings{klein_et_al:LIPIcs:2011:3129,
  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 =		{http://drops.dagstuhl.de/opus/volltexte/2011/3129},
  URN =		{urn:nbn:de:0030-drops-31295},
  doi =		{http://dx.doi.org/10.4230/LIPIcs.RTA.2011.71},
  annote =	{Keywords: Term Rewriting, Knuth-Bendix Completion, Multi-completion}
}

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


DROPS-Home | Fulltext Search | Imprint Published by LZI