Adventures in associative-commutative unification
| Autor: | Patrick Lincoln, Jim Christian |
|---|---|
| Rok vydání: | 1989 |
| Předmět: |
Algebra and Number Theory
Theoretical computer science Unification Matching (graph theory) Efficient algorithm Diophantine equation Space (mathematics) Prolog Computational Mathematics TheoryofComputation_MATHEMATICALLOGICANDFORMALLANGUAGES ComputingMethodologies_SYMBOLICANDALGEBRAICMANIPULATION Computer Science::Programming Languages computer Algorithm Commutative property Associative property Mathematics computer.programming_language |
| Zdroj: | Journal of Symbolic Computation. 8:217-240 |
| ISSN: | 0747-7171 |
| Popis: | We have discovered an efficient algorithm for matching and unification in associative-commutative (AC) equational theories. In most cases of AC unification our method obviates the need for solving diophantine equations, and thus avoids one of the bottlenecks of other associative-commutative unification techniques. The algorithm efficiently utilizes powerful constraints to eliminate much of the search involved in generating valid substitutions. Moreover, it is able to generate solutions lazily, enabling its use in an SLD-resolution-based environment like Prolog. We have found the method to run much faster and use less space than other associative-commutative unification procedures on many commonly encountered AC problems. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|