# Interleaving solving and elicitation of constraint satisfaction problems based on expected cost

- 71 Downloads
- 1 Citations

## Abstract

We consider Constraint Satisfaction Problems in which constraints can be initially incomplete, where it is unknown whether certain tuples satisfy the constraint or not. We assume that we can determine the satisfaction of such an unknown tuple, i.e., find out whether this tuple is in the constraint or not, but doing so incurs a known cost, which may vary between tuples. We also assume that we know the probability of an unknown tuple satisfying a constraint. We define algorithms for this problem, based on backtracking search. Specifically, we consider a simple iterative algorithm based on a cost limit on the unknowns that may be determined, and a more complex algorithm that delays determining an unknown in order to estimate better whether doing so is worthwhile. We show experimentally that the more sophisticated algorithms can greatly reduce the average cost.

## Keywords

Uncertain constraints Incomplete CSPs Interactive CSPs Open constraints Constraint elicitation## Preview

Unable to display preview. Download preview PDF.

## References

- 1.Amilhastre, J., Fargier, H., & Marquis, P. (2002). Consistency restoration and explanations in dynamic CSPs—Application to configuration.
*Artificial Intelligence, 135*, 199–234.zbMATHCrossRefMathSciNetGoogle Scholar - 2.Bellman, R. (1957).
*Dynamic programming*. Princeton University Press.Google Scholar - 3.Bistarelli, S., Montanari, U., Rossi, F., Schiex, T., Verfaillie, G., & Fargier, H. (1999). Semiring-based CSPs and Valued CSPs: Frameworks, properties and comparison.
*Constraints, 4*(3), 199–240.zbMATHCrossRefMathSciNetGoogle Scholar - 4.Brélaz, D. (1979). New methods to color the vertices of a graph.
*Communications of the ACM, 22*(4), 251–256.zbMATHCrossRefGoogle Scholar - 5.Cucchiara, R., Lamma, E., Mello, P., & Milano, M. (1997). An interactive constraint-based system for selective attention in visual search. In
*International syposium on methodologies for intelligent systems*(pp. 431–440).Google Scholar - 6.Dechter, A., & Dechter, R. (1989). On the greedy solution of ordering problems.
*ORSA Journal on Computing, 1*(3), 181–189.zbMATHMathSciNetGoogle Scholar - 7.Dechter, R., & Dechter, A. (1988). Belief maintenance in dynamic constraint networks. In
*Proceedings of the 7th national conference on artificial intelligence (AAAI-88)*(pp. 37–42).Google Scholar - 8.Faltings, B., & Macho-Gonzalez, S. (2002). Open constraint satisfaction. In
*Proceedings of the 8th international conference on principles and practice of constraint programming (CP-2002)*(pp. 356–370).Google Scholar - 9.Faltings, B., & Macho-Gonzalez, S. (2003). Open constraint optimization. In
*Proceedings of the 9th international conference on principles and practice of constraint programming (CP-2003)*(pp. 303–317).Google Scholar - 10.Faltings, B., & Macho-Gonzalez, S. (2005). Open constraint programming.
*Artificial Intelligence, 161*(1–2), 181–208.zbMATHCrossRefMathSciNetGoogle Scholar - 11.Fargier, H., & Lang, J. (1993). Uncertainty in Constraint Satisfaction Problems: A probabilistic approach. In
*Proceeedings of the European conference on symbolic and quantitative approaches to reasoning and uncertainty, (ECSQARU-93)*(pp. 97–104).Google Scholar - 12.Gelain, M., Pini, M. S., Rossi, F., & Venable, K. B. (2007). Dealing with incomplete preferences in soft constraint problems. In
*Proceedings of the 13th international conference on principles and practice of constraint programming (CP-2007)*.*LNCS*(Vol. 4741, pp. 286–300). Springer.Google Scholar - 13.Gelain, M., Pini, M. S., Rossi, F., Venable, K. B., & Walsh, T. (2008). Elicitation strategies for fuzzy constraint problems with missing preferences: Algorithms and experimental studies. In
*Proceedings of the 14th international conference on principles and practice of constraint programming (CP-2008)*.*LNCS*(Vol. 5202, pp. 402–417). Springer.Google Scholar - 14.Gelain, M., Pini, M. S., Rossi, F., Venable, K. B., & Walsh, T. (2010). Elicitation strategies for soft constraint problems with missing preferences: Properties, algorithms and experimental studies.
*Artificial Intelligence, 174*(3–4), 270–294.zbMATHCrossRefMathSciNetGoogle Scholar - 15.Gent, I. P., MacIntyre, E., Prosser, P., Smith, B. M., & Walsh, T. (2001). Random constraint satisfaction: Flaws and structure.
*Constraints, 6*(4), 345–372.zbMATHCrossRefMathSciNetGoogle Scholar - 16.Howard, R., & Matheson, J. (1984). Influence diagrams. In
*Readings on the principles and applications of decision analysis*(pp. 721–762).Google Scholar - 17.Lallouet, A., & Legtchenko, A. (2005). Consistencies for partially defined constraints. In
*Proceedings of the international conference on tools with artificial intelligence (ICTAI’05)*.Google Scholar - 18.Lamma, E., Mello, P., Milano, M., Cucchiara, R., Gavanelli, M., & Piccardi, M. (1999). Constraint propagation and value acquisition: Why we should do it interactively. In
*Proceedings of the 16th international joint conference on artificial intelligence (IJCAI-99)*(pp. 468–477).Google Scholar - 19.Larrosa, J., & Schiex, T. (2004). Solving weighted CSP by maintaining arc consistency.
*Artificial Intelligence, 159*(1–2), 1–26.zbMATHCrossRefMathSciNetGoogle Scholar - 20.Puterman, M. (1994).
*Markov decision processes, discrete stochastic dynamic programming*. Wiley.Google Scholar - 21.Tarim, S. A., Manadhar, A., & Walsh, T. (2006). Stochastic constraint programming: A scenario-based approach.
*Constraints, 11*(1), 53–80.zbMATHCrossRefMathSciNetGoogle Scholar - 22.Wilson, N., Grimes, D., & Freuder, E. (2007). A cost-based model and algorithms for interleaving solving and elicitation of CSPs. In
*Proceedings of the 13th international conference on principles and practice of constraint programming (CP-2007)*(pp. 666–680).Google Scholar