Adventures in associative-commutative unification (Q1262757): Difference between revisions
From MaRDI portal
Changed an Item |
Changed an Item |
||
| Property / describes a project that uses | |||
| Property / describes a project that uses: RRL / rank | |||
Normal rank | |||
Revision as of 10:08, 29 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Adventures in associative-commutative unification |
scientific article |
Statements
Adventures in associative-commutative unification (English)
0 references
1989
0 references
The authors present an efficient algorithm for unification and matching in associative-commutative theories. The algorithm is very efficient both in time and space and often it avoids the need for solving diophantine equations.
0 references
associativity
0 references
commutativity
0 references
equational theories
0 references
unification
0 references
