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.

Export metadata

  • Export Bibtex
  • Export RIS

Additional Services

Share in Twitter Search Google Scholar
Metadaten
Author:Jürgen Avenhaus, David A. Plaisted
URN (permanent link):urn:nbn:de:hbz:386-kluedo-3485
Serie (Series number):SEKI Report (95,7)
Document Type:Preprint
Language of publication:English
Year of Completion:1999
Year of Publication:1999
Publishing Institute:Technische Universität Kaiserslautern
Faculties / Organisational entities:Fachbereich Informatik
DDC-Cassification:004 Datenverarbeitung; Informatik

$Rev: 12793 $