Creative Commons Attribution 3.0 Unported license (CC-BY 3.0)when quoting this document, please refer to the following
DOI: 10.4230/LIPIcs.FSCD.2018.30
URN: urn:nbn:de:0030-drops-92001
URL: https://drops.dagstuhl.de/opus/volltexte/2018/9200/
Winkler, Sarah ; Middeldorp, Aart
Completion for Logically Constrained Rewriting
| pdf-format: |
|
Abstract
We propose an abstract completion procedure for logically constrained term rewrite systems (LCTRSs). This procedure can be instantiated to both standard Knuth-Bendix completion and ordered completion for LCTRSs, and we present a succinct and uniform correctness proof. A prototype implementation illustrates the viability of the new completion approach.
BibTeX - Entry
@InProceedings{winkler_et_al:LIPIcs:2018:9200,
author = {Sarah Winkler and Aart Middeldorp},
title = {{Completion for Logically Constrained Rewriting}},
booktitle = {3rd International Conference on Formal Structures for Computation and Deduction (FSCD 2018)},
pages = {30:1--30:18},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-077-4},
ISSN = {1868-8969},
year = {2018},
volume = {108},
editor = {H{\'e}l{\`e}ne Kirchner},
publisher = {Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},
address = {Dagstuhl, Germany},
URL = {http://drops.dagstuhl.de/opus/volltexte/2018/9200},
URN = {urn:nbn:de:0030-drops-92001},
doi = {10.4230/LIPIcs.FSCD.2018.30},
annote = {Keywords: Constrained rewriting, completion, automation, theorem proving}
}
| Keywords: | Constrained rewriting, completion, automation, theorem proving | |
| Seminar: | 3rd International Conference on Formal Structures for Computation and Deduction (FSCD 2018) | |
| Issue date: | 2018 | |
| Date of publication: | 04.07.2018 |
