Zobrazeno 1 - 10
of 32
pro vyhledávání: '"Wlodzimierz Drabent"'
Autor:
Wlodzimierz Drabent
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:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::ee3fff18e25d0e493b86c3e46072b733
http://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-190500
http://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-190500
Autor:
Wlodzimierz 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 for which the occur-check never succeeds in any run of a nondeterministi
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::33b9309d4199e1e2248ed9e9ec1a25f3
Autor:
Wlodzimierz Drabent
Publikováno v:
Logic-Based Program Synthesis and Transformation ISBN: 9783030452599
LOPSTR
LOPSTR
Logic programming is a declarative programming paradigm. Programming language Prolog makes logic programming possible, at least to a substantial extent. However the Prolog debugger works solely in terms of the operational semantics. So it is incompat
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::4c26e60b42a990fc089753a250020cb6
https://doi.org/10.1007/978-3-030-45260-5_12
https://doi.org/10.1007/978-3-030-45260-5_12
Autor:
Wlodzimierz Drabent
Publikováno v:
Formal Aspects of Computing. 29:155-172
Completeness of a logic program means that the program produces all the answers required by its specification. The cut is an important construct of programming language Prolog. It prunes part of the search space, this may result in a loss of complete
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::abe4696c476f1a0d95c5beb087fa6350
https://doi.org/10.1007/s00165-016-0392-0
https://doi.org/10.1007/s00165-016-0392-0
Autor:
Wlodzimierz Drabent
Publikováno v:
Theory and Practice of Logic Programming. 16:498-508
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 Logic Programming (TPLP).
11 pages. This version - small changes, v
11 pages. This version - small changes, v
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::e50a641996fdc9a2741a6674e54ccdc3
https://doi.org/10.1017/s1471068416000089
https://doi.org/10.1017/s1471068416000089
Autor:
Wlodzimierz Drabent
Publikováno v:
Logic-Based Program Synthesis and Transformation ISBN: 9783319178219
LOPSTR
LOPSTR
Program correctness (in imperative and functional programming) splits in logic programming into correctness and completeness. Completeness means that a program produces all the answers required by its specification. Little work has been devoted to re
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::11d24e28afc92892815db38f5c3333a3
https://doi.org/10.1007/978-3-319-17822-6_15
https://doi.org/10.1007/978-3-319-17822-6_15
Autor:
Wlodzimierz 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 which should be well known but is often neglected. Also, we show how to
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::cb0809d78c6eb12094a3b48f29757fea
http://arxiv.org/abs/1412.8739
http://arxiv.org/abs/1412.8739
Publikováno v:
Theory and Practice of Logic Programming. 5:669-711
We advocate a declarative approach to proving properties of logic programs. Total correctness can be separated into correctness, completeness and clean termination; the latter includes non-floundering. Only clean termination depends on the operationa
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::d0dd87cb4d5ca61c8ffbb4132c66cbae
https://doi.org/10.1017/s147106840500253x
https://doi.org/10.1017/s147106840500253x
Publikováno v:
Electronic Notes in Theoretical Computer Science. 30:215-234
The paper presents a diagnosis tool for CLP programs. It deals with partial correctness w.r.t. specifications which describe procedure calls and successes. The space of possible specifications is restricted to a kind of regular types; we propose a ge
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::91ae5dd600b851f78a088a1ba783c38f
https://doi.org/10.1016/s1571-0661(05)80659-0
https://doi.org/10.1016/s1571-0661(05)80659-0
Autor:
Wlodzimierz Drabent
Publikováno v:
Acta Informatica. 32:27-59
A standard approach to negation in logic programming is negation as failure. Its major drawback is that it cannot produce answer substitutions to negated queries. Approaches to overcoming this limitation are termed constructive negation. This work pr
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::c48880ff4ee7193531daf7b3943ec5c9
https://doi.org/10.1007/bf01185404
https://doi.org/10.1007/bf01185404