Please use this identifier to cite or link to this item:
doi:10.22028/D291-41629 | Title: | Ground Confluence |
| Author(s): | Göbel, Richard |
| Language: | English |
| Year of Publication: | 1986 |
| Place of publication: | Kaiserslautern |
| DDC notations: | 004 Computer science, internet |
| Publikation type: | Report |
| Abstract: | In this paper we introduce a test for confluence on ground terms. This test allows us to prove the ground confluence of term rewriting systems where the Knuth-Bendix Algorithm does not terminate. Ground Confluence of term rewriting systems is sufficient, if one is interested in congruences on ground terms. This is for example the case in the domain of inductive proofs or in the domain of program synthesis. |
| Link to this record: | urn:nbn:de:bsz:291--ds-416292 hdl:20.500.11880/37860 http://dx.doi.org/10.22028/D291-41629 |
| Series name: | SEKI-Report / Deutsches Forschungszentrum für Künstliche Intelligenz, DFKI [ISSN 1437-4447] |
| Series volume: | 86,18 |
| Date of registration: | 12-Jun-2024 |
| Faculty: | SE - Sonstige Einrichtungen |
| Department: | SE - DFKI Deutsches Forschungszentrum für Künstliche Intelligenz |
| Professorship: | SE - Sonstige |
| Collections: | SciDok - Der Wissenschaftsserver der Universität des Saarlandes |
Files for this record:
| File | Description | Size | Format | |
|---|---|---|---|---|
| SEKI-REPORT-SR-86-18_Göbel_Ground-Confluence .pdf | 14,08 MB | Adobe PDF | View/Open |
Items in SciDok are protected by copyright, with all rights reserved, unless otherwise indicated.