A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is `application/pdf`

.

##
###
A Cost-Based Model and Algorithms for Interleaving Solving and Elicitation of CSPs
[chapter]

*
Principles and Practice of Constraint Programming – CP 2007
*

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

doi:10.1007/978-3-540-74970-7_47
dblp:conf/cp/WilsonGF07
fatcat:g3ct4zl7mzbg3mgdj6peuwmivi