1 citations · 2 across the 6 of their papers we have counts for
Showing 2021Show all
3 papers · 1 filter
cs.LO2021★ 1 cited
A Note on Occur-Check
Włodzimierz Drabent
Most known results on avoiding the occur-check are based on the notion of "not subject to occur-check" (NSTO). It means that unification is performed only on such pairs of atoms fo…
cs.LO2021
On correctness and completeness of an n queens program
Włodzimierz Drabent
Thom Frühwirth presented a short, elegant and efficient Prolog program for the n queens problem. However the program may be seen as rather tricky and one may not be convinced about…
cs.LO2021
SLD-resolution without occur-check, an example
Włodzimierz Drabent
We prove that the occur-check is not needed for a certain definite clause logic program, independently from the selection rule. First we prove that the program is occur-check free.…