General Algorithms for Permutations in Equational Inference
- We study some general algorithms for processing permutations and permu-tation groups and consider their application to equational reasoning and term-rewriting systems. We also present some complexity results for particular equa-tional consequence problems related to permutations.
Download full text files
Additional Services
| Author: | Jürgen Avenhaus, David A. Plaisted |
|---|---|
| URN: | urn:nbn:de:hbz:386-kluedo-3485 |
| Series (Serial Number): | SEKI Report (95,7) |
| Document Type: | Preprint |
| Language of publication: | English |
| Year of Completion: | 1999 |
| Year of first Publication: | 1999 |
| Publishing Institution: | Technische Universität Kaiserslautern |
| Date of the Publication (Server): | 2000/04/03 |
| Faculties / Organisational entities: | Kaiserslautern - Fachbereich Informatik |
| DDC-Cassification: | 0 Allgemeines, Informatik, Informationswissenschaft / 004 Informatik |
| Licence (German): |  Standard gemäß KLUEDO-Leitlinien vor dem 27.05.2011 |