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.2010.373
URN: urn:nbn:de:0030-drops-26643
URL: http://dagstuhl.sunsite.rwth-aachen.de/volltexte/2010/2664/
Winkler, Sarah ;
Sato, Haruhiko ;
Middeldorp, Aart ;
Kurihara, Masahito
Optimizing mkbTT
Abstract
We describe performance enhancements that have been added to mkbTT, a
modern completion tool combining multi-completion with the use of
termination tools.
BibTeX - Entry
@InProceedings{winkler_et_al:LIPIcs:2010:2664,
author = {Sarah Winkler and Haruhiko Sato and Aart Middeldorp and Masahito Kurihara},
title = {{Optimizing mkbTT}},
booktitle = {Proceedings of the 21st International Conference on Rewriting Techniques and Applications},
pages = {373--384},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-939897-18-7},
ISSN = {1868-8969},
year = {2010},
volume = {6},
editor = {Christopher Lynch},
publisher = {Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},
address = {Dagstuhl, Germany},
URL = {http://drops.dagstuhl.de/opus/volltexte/2010/2664},
URN = {urn:nbn:de:0030-drops-26643},
doi = {10.4230/LIPIcs.RTA.2010.373},
annote = {Keywords: Knuth-Bendix completion, termination prover, automated deduction}
}
Keywords: |
|
Knuth-Bendix completion, termination prover, automated deduction |
Collection: |
|
Proceedings of the 21st International Conference on Rewriting Techniques and Applications |
Issue Date: |
|
2010 |
Date of publication: |
|
06.07.2010 |