Zobrazeno 1 - 10
of 18
pro vyhledávání: '"VANDENBROUCKE, ALEXANDER"'
Automatic differentiation (AD) has been a topic of interest for researchers in many disciplines, with increased popularity since its application to machine learning and neural networks. Although many researchers appreciate and know how to apply AD, i
Externí odkaz:
http://arxiv.org/abs/2212.11088
Delimited control is a powerful mechanism for programming language extension which has been recently proposed for Prolog (and implemented in SWI-Prolog). By manipulating the control flow of a program from inside the language, it enables the implement
Externí odkaz:
http://arxiv.org/abs/2108.02972
Delimited control is a powerful mechanism for programming language extension which has been recently proposed for Prolog (and implemented in SWI-Prolog). By manipulating the control flow of a program from inside the language, it enables the implement
Externí odkaz:
http://arxiv.org/abs/2009.04909
Publikováno v:
In Science of Computer Programming January 2024 231
Tabling is a powerful resolution mechanism for logic programs that captures their least fixed point semantics more faithfully than plain Prolog. In many tabling applications, we are not interested in the set of all answers to a goal, but only require
Externí odkaz:
http://arxiv.org/abs/1608.00787
Publikováno v:
Theory & Practice of Logic Programming; Jan2024, Vol. 24 Issue 1, p110-131, 22p
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Autor:
Vandenbroucke, Alexander
Declarative programming is the idea that a program should describe what it does, which problem it is solving, not how it does so. In this fashion, declarative programming focuses on the complexity that is inherent in the problem, not the accidental c
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=od______1131::cc0fb7938bff796b039e6ad5f80889d0
https://lirias.kuleuven.be/handle/123456789/664513
https://lirias.kuleuven.be/handle/123456789/664513
This work presents P𝜆𝜔NK, a functional probabilistic network programming language that extends Probabilistic NetKAT (PNK). Like PNK, it enables probabilistic modelling of network behaviour, by providing probabilistic choice and infinite iterati
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=od______1131::58f93c147b08cacdaeced3af5d334f66
https://lirias.kuleuven.be/handle/123456789/643931
https://lirias.kuleuven.be/handle/123456789/643931
PRISM and ProbLog are two prominent languages for Probabilistic Logic Programming. While they are superficially very similar, there are subtle differences between them that lead to different formulations of the same probabilistic model. This paper ai
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=od______1131::dc52374656be69379bb922c225e95cb9
https://lirias.kuleuven.be/handle/123456789/593530
https://lirias.kuleuven.be/handle/123456789/593530