Solvable Set II. A Goal-Driven Unification Algorithm for the Blended Case.
A universe composed by rational ground terms is characterized, both constructively and axiomatically, where the interpreted construct with which designates the operation of adjoining one element to a set, coexists with free Herbrand functors. Ordinary syntactic equivalence must be superseded by a bi...
| Yayımlandı: | Applicable algebra in engineering, communication and computing. 9, 4 (1999). |
|---|---|
| Yazar: | |
| Diğer Yazarlar: | , |
| Materyal Türü: | Makale |
| Dil: | English |
| Konular: |