LIPIcs.RTA.2011.71.pdf
- Filesize: 0.49 MB
- 10 pages
Document
Maximal Completion
Authors
-
Part of:
Volume:
22nd International Conference on Rewriting Techniques and Applications (RTA'11) (RTA 2011)
Series: Leibniz International Proceedings in Informatics (LIPIcs)
Conference: International Conference on Rewriting Techniques and Applications (RTA) - License:
Creative Commons Attribution-NonCommercial-NoDerivs 3.0 Unported license
- Publication Date: 2011-04-26
Cite As Get BibTex
Dominik Klein and Nao Hirokawa. Maximal Completion. In 22nd International Conference on Rewriting Techniques and Applications (RTA'11). Leibniz International Proceedings in Informatics (LIPIcs), Volume 10, pp. 71-80, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2011)
https://doi.org/10.4230/LIPIcs.RTA.2011.71
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.
Subject Classification
Keywords
- Term Rewriting
- Knuth-Bendix Completion
- Multi-completion
Metrics
- Access Statistics
-
Total Accesses (updated on a weekly basis)
0PDF Downloads