1 citations · 2 across the 4 of their papers we have counts for
5 papers · 1 filter
On systematic construction of correct logic programs
Włodzimierz Drabent
Partial correctness of imperative or functional programming divides in logic programming into two notions. Correctness means that all answers of the program are compatible with the…
On Feasibility of Declarative Diagnosis
Włodzimierz Drabent
The programming language Prolog makes declarative programming possible, at least to a substantial extent. Programs may be written and reasoned about in terms of their declarative s…
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…
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.…
On correctness 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 be not convinced about…