15 citations · 34 across the 14 of their papers we have counts for
16 papers
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…
Implementing backjumping by means of exception handling
Włodzimierz Drabent
We discuss how to implement backjumping (or intelligent backtracking) in Prolog by using the built-ins throw/1 and catch/3. We show that it is impossible in a general case, contrar…
A note on occur-check (extended report)
Włodzimierz Drabent
We weaken 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…
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…
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…
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.…
Implementing backjumping by throw/1 and catch/3 of Prolog
Włodzimierz Drabent
We discuss how to implement backjumping (or intelligent backtracking) in Prolog programs by means of exception handling. This seems impossible in a general case. We provide two sol…
S-semantics -- an example
Włodzimierz Drabent
The s-semantics makes it possible to explicitly deal with variables in program answers. So it seems suitable for programs using nonground data structures, like open lists. However…
The Prolog Debugger and Declarative Programming. Examples
Włodzimierz Drabent
This paper contains examples for a companion paper "The Prolog Debugger and Declarative Programming", which discusses (in)adequacy of the Prolog debugger for declarative programmin…
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…
The Prolog debugger and declarative programming
Włodzimierz Drabent
Logic programming is a declarative programming paradigm. Programming language Prolog makes logic programming possible, at least to a substantial extent. However the Prolog debugger…
On definite program answers and least Herbrand models
Włodzimierz Drabent
A sufficient and necessary condition is given under which least Herbrand models exactly characterize the answers of definite clause programs. To appear in Theory and Practice of Lo…
Correctness and completeness of logic programs
Włodzimierz Drabent
We discuss proving correctness and completeness of definite clause logic programs. We propose a method for proving completeness, while for proving correctness we employ a method wh…
On completeness of logic programs
Wlodzimierz Drabent
Program correctness (in imperative and functional programming) splits in logic programming into correctness and completeness. Completeness means that a program produces all the ans…
Hybrid Rules with Well-Founded Semantics
W. Drabent, J. Maluszynski
A general framework is proposed for integration of rules and external first order theories. It is based on the well-founded semantics of normal logic programs and inspired by ideas…