Narrowing vs. SLD-resolution (Q1105364)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 4058851
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Narrowing vs. SLD-resolution |
scientific article; zbMATH DE number 4058851 |
Statements
Narrowing vs. SLD-resolution (English)
0 references
1988
0 references
A comparison is performed between narrowing and SLD-resolution as regards their use in semantic unification (or E-unification). An E-unification algorithm based on flattening and SLD-resolution is developed and proved sound and complete by establishing a correspondence between narrowing sequences and resolution sequences. An E-unification algorithm based on a refined (``selection'') narrowing strategy is derived by adapting the SLD-strategy to narrowing. Finally, possible applications to the domain of logic\(+functional\) programming are considered.
0 references
narrowing
0 references
SLD-resolution
0 references
semantic unification
0 references
E-unification
0 references
\(\log ic+functional\) programming
0 references
0.8432590365409851
0 references
0.794451117515564
0 references
0.7937288880348206
0 references
