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...

Full description

Bibliographic Details

Published in:	Theoretical computer science Vol. 975; p. 114107
Main Author:	Drabent, Włodzimierz
Format:	Journal Article
Language:	English
Published:	Elsevier B.V 09.10.2023
Subjects:	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
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!