Termination of ground non-symmetric Knuth-Bendix completion
- In the most natural approach, ground Knuth-Bendix completion procedures for non-symmetric transitive relations and quasiorderings, as specified in [16], need not terminate. We use a two-step transformation on the input expressions to enforce termination after O(n) steps in the size of the input. We apply the completion procedure for developing rule-based declarative and dynamic algorithms for detecting embeddings in ground rewrite sequences. These results are interesting for the constraint-based analysis of state transition systems, for partial evaluation and for the reachability and termination analysis of ground term rewrite systems.
| Author: | Georg StruthGND |
|---|---|
| URN: | urn:nbn:de:bvb:384-opus4-1803 |
| Frontdoor URL | https://opus.bibliothek.uni-augsburg.de/opus4/229 |
| Series (Serial Number): | Reports / Technische Berichte der Fakultät für Angewandte Informatik der Universität Augsburg (2002-09) |
| Publisher: | Institut für Informatik, Universität Augsburg |
| Place of publication: | Augsburg |
| Type: | Report |
| Language: | English |
| Year of first Publication: | 2002 |
| Publishing Institution: | Universität Augsburg |
| Release Date: | 2006/06/13 |
| Tag: | Knuth-Bendix completion; transitive relations; quasiorderings; reachability; termination; homeomorphic embedding |
| Institutes: | Fakultät für Angewandte Informatik |
| Fakultät für Angewandte Informatik / Institut für Informatik | |
| Fakultät für Angewandte Informatik / Institut für Informatik / Professur für Programmiermethodik und Multimediale Informationssysteme | |
| Dewey Decimal Classification: | 0 Informatik, Informationswissenschaft, allgemeine Werke / 00 Informatik, Wissen, Systeme / 004 Datenverarbeitung; Informatik |
