Complete Sets of Reductions Modulo Associativity, Commutativity and Identity
Abstract
We Describe the Theory and Implementation of a Process Which Finds Complete Sets of Reductions Modulo Equational Theories Which Contain One or More Associative and Commutative Operators with Identity (ACI Theories). We Emphasize Those Features Which Distinguish This Process from the Similar One Which Works Modulo Associativity and Commutativity. a Primary Difference is that for Some Rules in ACI Complete Sets, Restrictions Are Required on the Substitutions Allowed When the Rules Are Applied. Without These Restrictions, Termination Cannot Be Guaranteed. We Exhibit Six Examples of ACI Complete Sets that Were Generated by an Implementation.
Recommended Citation
T. B. Baird et al., "Complete Sets of Reductions Modulo Associativity, Commutativity and Identity," Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 355 LNCS, pp. 29 - 44, Springer, Jan 1989.
The definitive version is available at https://doi.org/10.1007/3-540-51081-8_98
Department(s)
Computer Science
International Standard Book Number (ISBN)
978-354051081-9
International Standard Serial Number (ISSN)
1611-3349; 0302-9743
Document Type
Article - Conference proceedings
Document Version
Citation
File Type
text
Language(s)
English
Rights
© 2023 Springer, All rights reserved.
Publication Date
01 Jan 1989
