Maximal completion. (English) Zbl 1236.68133
Schmid-Schauß, Manfred (ed.), 22nd international conference on rewriting techniques and applications (RTA 2011), Novi Sad, Serbia, May 30 – June 1, 2011. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik (ISBN 978-3-939897-30-9). LIPIcs – Leibniz International Proceedings in Informatics 10, 71-80, electronic only (2011).
Summary: 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.
For the entire collection see [Zbl 1235.68033].
For the entire collection see [Zbl 1235.68033].
MSC:
| 68Q42 | Grammars and rewriting systems |
