A universal unification algorithm based on unification-driven leftmost outermost narrowing
We formalize a universal unification algorithm for the class of equational theories which is induced by the class of canonical, totally-defined, not strictly subunifiable term rewriting systems (for short: etn-tra). For a ctn-tra R and for two terms t and s, the algorithm computes a ground-complete...
Elmentve itt :
| Szerzők: | |
|---|---|
| Dokumentumtípus: | Cikk |
| Megjelent: |
1994
|
| Sorozat: | Acta cybernetica
11 No. 3 |
| Kulcsszavak: | Számítástechnika, Kibernetika |
| Tárgyszavak: | |
| Online Access: | http://acta.bibl.u-szeged.hu/12526 |
| LEADER | 01963nab a2200229 i 4500 | ||
|---|---|---|---|
| 001 | acta12526 | ||
| 005 | 20220613112902.0 | ||
| 008 | 161015s1994 hu o 0|| eng d | ||
| 022 | |a 0324-721X | ||
| 040 | |a SZTE Egyetemi Kiadványok Repozitórium |b hun | ||
| 041 | |a eng | ||
| 100 | 1 | |a Fassbender Heinz | |
| 245 | 1 | 2 | |a A universal unification algorithm based on unification-driven leftmost outermost narrowing |h [elektronikus dokumentum] / |c Fassbender Heinz |
| 260 | |c 1994 | ||
| 300 | |a 139-167 | ||
| 490 | 0 | |a Acta cybernetica |v 11 No. 3 | |
| 520 | 3 | |a We formalize a universal unification algorithm for the class of equational theories which is induced by the class of canonical, totally-defined, not strictly subunifiable term rewriting systems (for short: etn-tra). For a ctn-tra R and for two terms t and s, the algorithm computes a ground-complete set of (Ez, A)-unifiers of t and s, where Ez is the set of rewrite rules of R viewed as equations and A is the set of constructor symbols. The algorithm is based on the unification-driven leftmost outermost narrowing relation (for short: ulo narrowing relation) which is introduced in this paper. The ulo narrowing relation interleaves leftmost outermost narrowing steps with decomposition steps taken from the usual unification of terms. In its turn, every decomposition step involves a consistency check on constructor symbols combined with a particular form of the occur check. Since decomposition steps are performed as early as possible, some of the nonsuccessful derivations can be stopped earlier than in other universal unification algorithms for ctn-trs's. We give a proof that our algorithm really is a universal unification algorithm. | |
| 650 | 4 | |a Természettudományok | |
| 650 | 4 | |a Számítás- és információtudomány | |
| 695 | |a Számítástechnika, Kibernetika | ||
| 700 | 0 | 1 | |a Vogler Heiko |e aut |
| 856 | 4 | 0 | |u http://acta.bibl.u-szeged.hu/12526/1/cybernetica_011_numb_003_139-167.pdf |z Dokumentum-elérés |