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: |
Fassbender Heinz Vogler Heiko |
---|---|
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 |
Hasonló tételek
-
Unification for effective and finite semantic tableaux in first-order logic the SOFIA prover : [abstract] /
Szerző: Kovásznai Gergely
Megjelent: (2004) -
The unification of the law of bills of exchange read at Budapest on september 23rd, 1908 at a conference of the International Law Association /
Szerző: Marais Georges
Megjelent: (1908) -
The unification of the law of bills of exchange read at Budapest on september 23rd, 1908 at a conference of the International Law Association /
Szerző: Byles W. J. Barnard
Megjelent: (1908) -
The unification of the laws concerning bills of exchange read at Budapest on september 23rd, 1908 at a conference of the International Law Association /
Szerző: Sichermann Bernát -
Model driven testing of component based systems [abstract] /
Szerző: Bátori Gábor, et al.
Megjelent: (2006)