License:
Creative Commons Attribution 3.0 Unported license (CC BY 3.0)
When quoting this document, please refer to the following
DOI: 10.4230/LIPIcs.RTA.2013.319
URN: urn:nbn:de:0030-drops-40702
URL: http://dagstuhl.sunsite.rwth-aachen.de/volltexte/2013/4070/
Winkler, Sarah ;
Middeldorp, Aart
Normalized Completion Revisited
Abstract
Normalized completion (Marché 1996) is a widely applicable and efficient technique for com- pletion modulo theories. If successful, a normalized completion procedure computes a rewrite system that allows to decide the validity problem using normalized rewriting. In this paper we consider a slightly simplified inference system for finite normalized completion runs. We prove correctness, show faithfulness of critical pair criteria in our setting, and propose a different notion of normalizing pairs. We then show how normalized completion procedures can benefit from AC- termination tools instead of relying on a fixed AC-compatible reduction order. We outline our implementation of this approach in the completion tool mkbtt and present experimental results, including new completions.
BibTeX - Entry
@InProceedings{winkler_et_al:LIPIcs:2013:4070,
author = {Sarah Winkler and Aart Middeldorp},
title = {{Normalized Completion Revisited}},
booktitle = {24th International Conference on Rewriting Techniques and Applications (RTA 2013)},
pages = {319--334},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-939897-53-8},
ISSN = {1868-8969},
year = {2013},
volume = {21},
editor = {Femke van Raamsdonk},
publisher = {Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},
address = {Dagstuhl, Germany},
URL = {http://drops.dagstuhl.de/opus/volltexte/2013/4070},
URN = {urn:nbn:de:0030-drops-40702},
doi = {10.4230/LIPIcs.RTA.2013.319},
annote = {Keywords: term rewriting, completion}
}
Keywords: |
|
term rewriting, completion |
Collection: |
|
24th International Conference on Rewriting Techniques and Applications (RTA 2013) |
Issue Date: |
|
2013 |
Date of publication: |
|
24.06.2013 |