A relaxed condition for avoiding the occur-check

We generalize the notion of “not subject to occur-check” (NSTO), on which most known results on avoiding the occur-check in logic programming are based. NSTO means that unification is performed only on such pairs of atoms for which the occur-check never succeeds in any run of a nondeterministic unif...

Celý popis

Podrobná bibliografia

Vydané v:	Theoretical computer science Ročník 975; s. 114107
Hlavný autor:	Drabent, Włodzimierz
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	Elsevier B.V 09.10.2023
Predmet:	Delays/coroutining Logic programming Modes Occur-check Selection rule SLD-resolution Unification Modes Logic programming Unification Occur-check Selection rule Delays/coroutining SLD-resolution
ISSN:	0304-3975
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!