Advertisement

Abstract

The Stochastic CSP (SCSP) is a framework recently introduced by Walsh to capture combinatorial decision problems that involve uncertainty and probabilities. The SCSP extends the classical CSP by including both decision variables, that an agent can set, and stochastic variables that follow a probability distribution and can model uncertain events beyond the agent’s control. So far, two approaches to solving SCSPs have been proposed; backtracking-based procedures that extend standard methods from CSPs, and scenario-based methods that solve SCSPs by reducing them to a sequence of CSPs. In this paper we further investigate the former approach. We first identify and correct a flaw in the forward checking (FC) procedure proposed by Walsh. We also extend FC to better take advantage of probabilities and thus achieve stronger pruning. Then we define arc consistency for SCSPs and introduce an arc consistency algorithm that can handle constraints of any arity.

Keywords

Decision Variable Stochastic Variable Current Variable Recursive Call Chance Constraint 
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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Bessière, C., Régin, J.C., Yap, R., Zhang, Y.: An Optimal Coarse-grained Arc Consistency Algorithm. Artificial Intelligence 165(2), 165–185 (2005)MATHCrossRefMathSciNetGoogle Scholar
  2. 2.
    Bordeaux, L., Cadoli, M., Mancini, T.: CSP Properties for Quantified Constraints: Definitions and Complexity. In: Proceedings of AAAI 2005, pp. 360–365 (2005)Google Scholar
  3. 3.
    Bordeaux, L.: Boolean and interval propagation for quantified constraints. In: Proceedings of the CP 2005 Workshop on Quantification in Constraint Programming, pp. 16–30 (2005)Google Scholar
  4. 4.
    Dubois, D., Fargier, H., Prade, H.: Possibility Theory in Constraint Satisfaction Problems: Handling Priority, Preference and Uncertainty. Applied Intelligence 6(4), 287–309 (1996)CrossRefMathSciNetGoogle Scholar
  5. 5.
    Fiat, A., Woeginger, G.J. (eds.): Online Algorithms. LNCS, vol. 1442. Springer, Heidelberg (1998)MATHGoogle Scholar
  6. 6.
    Littman, M.L., Majercik, S.M., Pitassi, T.: Stochastic Boolean Satisfiability. Journal of Automated Reasoning 27(3), 251–296 (2000)CrossRefMathSciNetGoogle Scholar
  7. 7.
    Manandhar, S., Tarim, A., Walsh, T.: Scenario-based Stochastic Constraint Programming. In: Proceedings of IJCAI 2003, pp. 257–262 (2003)Google Scholar
  8. 8.
    Ruszczynski, A., Shapiro, A.: Stochastic Programming. In: Handbooks in OR/MS, vol. 10. Elsevier Science, Amsterdam (2003)Google Scholar
  9. 9.
    Verfaillie, G., Jussien, N.: Constraint Solving in Uncertain and Dynamic Environments: A Survey. Constraints 10(3), 253–281 (2005)MATHCrossRefMathSciNetGoogle Scholar
  10. 10.
    Walsh, T.: Stochastic Constraint Programming. In: Proceedings of ECAI 2002, pp. 111–115 (2002)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2006

Authors and Affiliations

  • Thanasis Balafoutis
    • 1
  • Kostas Stergiou
    • 1
  1. 1.Department of Information and Communication Systems EngineeringUniversity of the AegeanSamosGreece

Personalised recommendations