Zobrazeno 1 - 10
of 38
pro vyhledávání: '"Drabent, Wlodzimierz"'
Autor:
Drabent, Włodzimierz
Publikováno v:
EPTCS 385, 2023, pp. 193-200
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 semantics. All the advantages of declarative programming are however lo
Externí odkaz:
http://arxiv.org/abs/2308.15867
Autor:
Drabent, Włodzimierz
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, contrary to a claim that ``backjumping is exception handling". We provide two
Externí odkaz:
http://arxiv.org/abs/2305.16137
Autor:
Drabent, Włodzimierz
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 performed only on such pairs of atoms for which the occur-check never
Externí odkaz:
http://arxiv.org/abs/2204.05379
Autor:
Drabent, Włodzimierz
Publikováno v:
EPTCS 345, 2021, pp. 54-67
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 for which the occur-check never succeeds in any run of a nondeterministi
Externí odkaz:
http://arxiv.org/abs/2109.08278
Autor:
Drabent, Włodzimierz
Publikováno v:
Theory and Practice of Logic Programming, Volume 22 , Issue 1 , January 2022 , pp. 37 - 50
Thom Fr\"uhwirth 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 its correctness. This paper explains the program in a declarative w
Externí odkaz:
http://arxiv.org/abs/2108.08079
Autor:
Drabent, Włodzimierz
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. Then we consider a more general class of queries, under which the pro
Externí odkaz:
http://arxiv.org/abs/2103.01911
Autor:
Drabent, Włodzimierz
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 solutions. One works for binary programs; in a general case it imposes a
Externí odkaz:
http://arxiv.org/abs/2008.09610
Autor:
Drabent, Włodzimierz
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 it is difficult to find published examples of using the s-semantics to
Externí odkaz:
http://arxiv.org/abs/2006.06077
Autor:
Drabent, Włodzimierz
This paper contains examples for a companion paper "The Prolog Debugger and Declarative Programming", which discusses (in)adequacy of the Prolog debugger for declarative programming. Logic programming is a declarative programming paradigm. Programmin
Externí odkaz:
http://arxiv.org/abs/2003.01422
