Adventures in associative-commutative unification (Q1262757): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Q3696522 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Associative-commutative unification / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3703287 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Unification in abelian semigroups / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: An algorithm to generate the basis of solutions to homogeneous linear Diophantine equations / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: An Efficient Unification Algorithm / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3707399 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A Unification Algorithm for Associative-Commutative Functions / rank | |||
Normal rank | |||
Latest revision as of 11:41, 20 June 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
0 references
