A Cost-Based Model and Algorithms for Interleaving Solving and Elicitation of CSPs

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 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 which unknowns 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.

[1]  Thomas Schiex,et al.  Solving weighted CSP by maintaining arc consistency , 2004, Artif. Intell..

[2]  Nicolas Barnier,et al.  Solving the Kirkman's schoolgirl problem in a few seconds , 2002 .

[3]  Evelina Lamma,et al.  An Interactive Constraint-Based System for Selective Attention in Visual Search , 1997, ISMIS.

[4]  Boi Faltings,et al.  Open constraint programming , 2005, Artif. Intell..

[5]  Ronald A. Howard,et al.  Readings on the Principles and Applications of Decision Analysis , 1989 .

[6]  Pierre Marquis,et al.  Consistency restoration and explanations in dynamic CSPs Application to configuration , 2002, Artif. Intell..

[7]  Evelina Lamma,et al.  Constraint Propagation and Value Acquisition: Why we should do it Interactively , 1999, IJCAI.

[8]  Boi Faltings,et al.  Open Constraint Optimization , 2003, CP.

[9]  Rina Dechter,et al.  Belief Maintenance in Dynamic Constraint Networks , 1988, AAAI.

[10]  Michael Clarke,et al.  Symbolic and Quantitative Approaches to Reasoning and Uncertainty , 1991, Lecture Notes in Computer Science.

[11]  Toby Walsh,et al.  Stochastic Constraint Programming , 2002, ECAI.

[12]  Francesca Rossi,et al.  Principles and Practice of Constraint Programming – CP 2003 , 2003, Lecture Notes in Computer Science.

[13]  Boi Faltings,et al.  Open Constraint Satisfaction , 2002, CP.

[14]  Toby Walsh,et al.  Stochastic Constraint Programming: A Scenario-Based Approach , 2009, Constraints.

[15]  Arnaud Lallouet,et al.  Building Consistencies for Partially Defined Constraints with Decision Trees and Neural Networks , 2007, Int. J. Artif. Intell. Tools.

[16]  Martin L. Puterman,et al.  Markov Decision Processes: Discrete Stochastic Dynamic Programming , 1994 .

[17]  Sean R Eddy,et al.  What is dynamic programming? , 2004, Nature Biotechnology.

[18]  Arnaud Lallouet,et al.  Consistency for Partially Defined Constraints , 2005, CP.

[19]  Ronald A. Howard,et al.  Influence Diagrams , 2005, Decis. Anal..

[20]  Jérôme Lang,et al.  Uncertainty in Constraint Satisfaction Problems: a Probalistic Approach , 1993, ECSQARU.

[21]  J. van Leeuwen,et al.  Principles and Practice of Constraint Programming - CP 2002 , 2002, Lecture Notes in Computer Science.