We argue that the clp(X) framework is a suitable vehicle for extending logic programming (LP) with probabilistic reasoning. This paper presents such a generic framework, clp(pdf(Y)), and proposes two promising instances. The first provides a seamless integration of Bayesian Networks, while the second defines distributions over variables and employs conditional constraints over predicates. The generic methodology is based on attaching probability distributions over finite domains. We illustrate computational benefits of this approach by comparing program performances with a clp(fd) program on a cryptographic problem. © Springer-Verlag 2003.
CITATION STYLE
Angelopoulos, N. (2003). Clp(pdf(y)): Constraints for probabilistic reasoning in logic programming. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2833, 784–788. https://doi.org/10.1007/978-3-540-45193-8_53
Mendeley helps you to discover research relevant for your work.