Abstract
Probabilistic Choice Operators (PCOs) are convenient tools to model uncertainty in CP. They are useful to implement randomized algorithms and stochastic processes in the concurrent constraint framework. Their implementation is based on the random selection of a value inside a finite domain according to a given probability distribution. Unfortunately, the probabilistic choice of a PCO is usually delayed until the probability distribution is completely known. This is inefficient and penalizes their broader adoption in real-world applications. In this paper, we associate to PCO a filtering algorithm that prunes the variation domain of its random variable during constraint propagation. Our algorithm runs in O(n) where n denotes the size of the domain of the probabilistic choice. Experimental results show the practical interest of this approach.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Carlsson, M., Ottosson, G., Carlson, B.: An Open–Ended Finite Domain Constraint Solver. In: Proceedings of Programming Languages: Implementations, Logics, and Programs (1997)
Di Pierro, A., Wiklicky, H.: On probabilistic CCP. In: APPIA-GULP-PRODE, Grado, Italy, pp. 225–234 (1997)
Di Pierro, A., Wiklicky, H.: Implementing randomised algorithms in constraint logic programming. In: Proceedings of the ERCIM/Compulog Workshop on Constraints (2000)
Fargier, H., Lang, J.: Uncertainty in constraint satisfaction problems: A probabilistic approach. In: Proceedings of the European Conference on Symbolic and Quantitative Approaches to Reasoning and Uncertainty, Grenada, pp. 97–104. Springer, Heidelberg (1993)
Gupta, V., Jagadeesan, R., Panangaden, P.: Stochastic processes as concurrent constraint programs. In: Proceedings of Symposium on Principles of Programming Languages (1999)
Gupta, V., Jagadeesan, R., Saraswat, V.A.: Probabilistic concurrent constraint programming. In: Proceedings of the International Conference Conference on Concurrency Theory, pp. 243–257. Springer, Heidelberg (1997)
Van Hentenryck, P., Saraswat, V., Deville, Y.: Design, implementation, and evaluation of the constraint language cc(fd). Technical Report CS-93-02, Brown University (1993)
Janson, S., Haridi, S.: Programming paradigms of the Andorra kernel language. In: Proceedings of the International Symposium on Logic Programming, San Diego, USA, pp. 167–186 (1991)
Petit, M., Gotlieb, A.: Probabilistic choice operators as global constraints: application to statistical software testing. In: Proceedings of International Conference on Logic Programming – Poster Presentation. LNCS, pp. 471–472 (2004)
Petit, M., Gotlieb, A.: Library of probabilistic constraint combinators over finite domain (May 2006), available at http://www.irisa.fr/lande/petit/tools.html
Petit, M., Gotlieb, A.: Constraint-based reasoning on probabilistic choice operators. Research Report 6165, INRIA, 04 (2007)
Saraswat, V.A., Rinard, M., Panangaden, P.: Semantic foundations of concurrent constraint programming. In: Proceedings of Symposium on Principles of Programming Languages, Orlando, Florida, pp. 333–352 (1991)
Smolka, G.: The Oz programming model. In: van Leeuwen, J. (ed.) Computer Science Today. LNCS, vol. 1000, pp. 324–343. Springer, Heidelberg (1995)
Tarim, S.A., Manandhar, S., Walsh, T.: Stochastic constraint programming: A scenario-based approach. Constraints 11(1), 53–80 (2006)
Thévenod-Fosse, P., Waeselynck, H.: An investigation of statistical software testing. Journal of Sotware Testing, Verification and Reliability 1(2), 5–25 (1991)
Walsh, T.: Stochastic constraint programming. In: Proceedings of the 15th European Conference on Artificial Intelligence, Lyon, France, pp. 111–115. IOS Press, Amsterdam, Trento, Italy (2002)
Yorke-Smith, N., Gervet, C.: Certainty closure: A framework for reliable constraint reasoning with uncertainty. In: Proceedings of the International Conference on Principles and Practice of Constraint Programming, Kinsale, Ireland. LNCS, pp. 769–783. Springer, Heidelberg (2003)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Petit, M., Gotlieb, A. (2007). Boosting Probabilistic Choice Operators. In: Bessière, C. (eds) Principles and Practice of Constraint Programming – CP 2007. CP 2007. Lecture Notes in Computer Science, vol 4741. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-74970-7_40
Download citation
DOI: https://doi.org/10.1007/978-3-540-74970-7_40
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-74969-1
Online ISBN: 978-3-540-74970-7
eBook Packages: Computer ScienceComputer Science (R0)