Probabilistic Space Partitioning in Constraint Logic Programming

  • Nicos Angelopoulos
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 3321)


We present a language for integrating probabilistic reasoning and logic programming. The key idea is to use constraints based techniques such as the constraints store and finite domain variables. First we show how these techniques can be used to integrate a number of probabilistic inference algorithms with logic programming. We then proceed to detail a language which effects conditioning by probabilistically partitioning the constraint store. We elucidate the kinds of reasoning effected by the introduced language by means of two well known probabilistic problems: the three prisoners and Monty Hall. In particular we show how the syntax of the language can be used to avoid the pitfalls normally associated with the two problems. An elimination algorithm for computing the probability of a query in a given store is presented.


Logic Program Logic Programming Probabilistic Reasoning Probabilistic Variable Probabilistic Inference 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. Angelopoulos, N.: Probabilistic Finite Domains. Ph.D. thesis, Department of Computing, City University, London, UK (2001)Google Scholar
  2. Angelopoulos, N.: clp(pfd(Y)): Constraints for probabilistic reasoning in logic programming. In: Ninth International Conference on Principles and Practice of Constraint Programming Kinsale, Ireland (2003)Google Scholar
  3. Baldwin, J.F.: Evidential support logic programming. Journal of Fuzzy Sets and Systems 24, 1–26 (1987)Google Scholar
  4. Costa, V., Page, D., Qazi, M., Cussens, J.: CLP(\(\mathcal{BN}\)) constraint logic programming for probabilistic knowledge. In: 19th Annual Conference on Uncertainty in AI, Acapulco, Mexico, pp. 517–524 (2002)Google Scholar
  5. Cussens, J.: Stochastic logic programs: Sampling, inference and applications. In: 16th Annual Conference on Uncertainty in AI, San Francisco, USA, pp. 115–122 (2000)Google Scholar
  6. Dechter, R.: Bucket elimination: A unifying framework for probabilistic inference. In: Proceedings of Uncertainty in AI (UAI 1996), Portland, USA (1996); Extended version in Dechter99Google Scholar
  7. Dechter, R. Larkin, D. Hybrid processing of beliefs and constraints. In: Proceedings of Uncertainty in AI (UAI 2001). Extended version in Dechter2001aGoogle Scholar
  8. Grinstead, C.M., Snell, J.L.: Introduction to Probability (Second Revised Edition) American Mathematical SocietyGoogle Scholar
  9. Grünwald, P., Halpern, J.: Updating probabilities. Journal of AI Research 19, 243–278 (2003)Google Scholar
  10. Kyburg, H.E.: The reference class. Philosophy of Science 50, 374–397 (1983)CrossRefMathSciNetGoogle Scholar
  11. Kyburg, H.E.: Uncertain inferences and uncertain conclusions. In: 12th Annual Conference on Uncertainty in AI, pp. 365–372 (1996)Google Scholar
  12. Hogger, C.J.: Essentials of Logic Programming. Oxford University Press, Oxford (1990)zbMATHGoogle Scholar
  13. Jaffar, J., Lassez, J.-L.: Constraint logic programming. In: POPL 1987: Proceedings 14th ACM Symposium on Principles of Programming Languages, Munich, pp. 111–119. ACM, New York (1987)CrossRefGoogle Scholar
  14. Kameya, Y., Sato, T.: Efficient learning with tabulation for parameterized logic programs. In: Palamidessi, C., Moniz Pereira, L., Lloyd, J.W., Dahl, V., Furbach, U., Kerber, M., Lau, K.-K., Sagiv, Y., Stuckey, P.J. (eds.) CL 2000. LNCS (LNAI), vol. 1861, pp. 269–294. Springer, Heidelberg (2000)CrossRefGoogle Scholar
  15. Lukasiewicz, T.: Probabilistic logic programming. In: 13th Biennial European Conference on Artificial Intelligence, Brighton, UK, pp. 388–392 (1999)Google Scholar
  16. Lukasiewicz, T.: Probabilistic logic programming under inheritance with overriding. In: 17th Conference on Uncertainty in Artificial Intelligence (UAI-2001), Seattle, Washington, USA, pp. 329–336 (2001)Google Scholar
  17. Montanari, U.: Networks of constraints: Fundamental properties and applications to picture processing. Information Sciences 7, 95–132 (1974)CrossRefMathSciNetGoogle Scholar
  18. Mosteller, F.: Fifty challenging problems in probability, with solutions. Addison-Wesley, Reading (1965)Google Scholar
  19. Ng, R., Subrahmanian, V.: Probabilistic logic programming. Information and Computation 101, 150–201 (1992)zbMATHCrossRefMathSciNetGoogle Scholar
  20. Pollock, J.L.: The theory of nomic probability. Synthese 90, 263–300 (1992)zbMATHCrossRefMathSciNetGoogle Scholar
  21. Poole, D.: Probabilistic horn abduction and bayesian networks. Artificial Intelligence 64, 81–129 (1993)zbMATHCrossRefGoogle Scholar
  22. Riezler, S.: Probabilistic Constraint Logic Programming. Ph.D. thesis, Neuphilologische Fakultät, Universität Tübingen, Tubingen, Germany (1998)Google Scholar
  23. Saraswat, V.: The category of constraint systems is Cartesian-closed. In: Proceedings, Seventh Annual IEEE Symposium on Logic in Computer Science, Santa Cruz, California, IEEE Computer Society Press, Los Alamitos (1992)Google Scholar
  24. vos Savant, M.: Ask Marilyn. St. Martins, New York (1992)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2004

Authors and Affiliations

  • Nicos Angelopoulos
    • 1
  1. 1.Department of Computer ScienceUniversity of YorkHeslington, YorkUK

Personalised recommendations