Please use this identifier to cite or link to this item:
doi:10.22028/D291-41575 | Title: | How to Prove Ground Confluence |
| Author(s): | Becker, Klaus |
| Language: | English |
| Year of Publication: | 1996 |
| Place of publication: | Kaiserslautern |
| DDC notations: | 004 Computer science, internet |
| Publikation type: | Report |
| Abstract: | We show how to prove ground confluence of term rewrite relations that are induced by reductive systems of clausal rewrite rules. According to a well-known critical pair criterion it suffices for such systems to prove ground joinability of a suitable set of ‘critical clauses’. We outline how the latter can be done in a systematic fashion, using mathematical induction as a key concept of reasoning. |
| Link to this record: | urn:nbn:de:bsz:291--ds-415750 hdl:20.500.11880/37799 http://dx.doi.org/10.22028/D291-41575 |
| Series name: | SEKI-Report / Deutsches Forschungszentrum für Künstliche Intelligenz, DFKI [ISSN 1437-4447] |
| Series volume: | 96,2 |
| Date of registration: | 5-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-96-02_Becker_How-to-Prove-Ground-Confluence.pdf | 1,8 MB | Adobe PDF | View/Open |
Items in SciDok are protected by copyright, with all rights reserved, unless otherwise indicated.