clp(pdf(y)): Constraints for Probabilistic Reasoning in Logic Programming

  • Nicos Angelopoulos
Conference paper

DOI: 10.1007/978-3-540-45193-8_53

Part of the Lecture Notes in Computer Science book series (LNCS, volume 2833)
Cite this paper as:
Angelopoulos N. (2003) clp(pdf(y)): Constraints for Probabilistic Reasoning in Logic Programming. In: Rossi F. (eds) Principles and Practice of Constraint Programming – CP 2003. CP 2003. Lecture Notes in Computer Science, vol 2833. Springer, Berlin, Heidelberg

Abstract

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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2003

Authors and Affiliations

  • Nicos Angelopoulos
    • 1
  1. 1.Department of Computer ScienceYork UniversityYorkUK

Personalised recommendations