Dealing with Incomplete Preferences in Soft Constraint Problems

@inproceedings{Gelain2007DealingWI,
  title={Dealing with Incomplete Preferences in Soft Constraint Problems},
  author={Mirco Gelain and Maria Silvia Pini and Francesca Rossi and Kristen Brent Venable},
  booktitle={CP},
  year={2007}
}
We consider soft constraint problems where some of the prefe renc s may be unspecified. This models, for example, situations wit h several agents providing the data, or with possible privacy issues. In this con text, we study how to find an optimal solution without having to wait for all the pre ferences. In particular, we define an algorithm to find a solution which is necessa rily optimal, that is, optimal no matter what the missing data will be, with the a im to ask the user to reveal as few… CONTINUE READING
Highly Cited
This paper has 41 citations. REVIEW CITATIONS

Citations

Publications citing this paper.
Showing 1-10 of 20 extracted citations

References

Publications referenced by this paper.
Showing 1-10 of 15 references

On th e relation among open, interactive and dynamic CSP. InThe Fifth Workshop on Modelling and Solving Problems with Constraints

  • S. Macho González, C. Ansótegui, P. Meseguer
  • 2005
Highly Influential
14 Excerpts

Open constraint satis fac ion. InCP, volume 2470 of Lecture Notes in Computer Science

  • B. Faltings, S. Macho-Gonzalez
  • 2002
Highly Influential
14 Excerpts

Valued Constrain t Satisfaction Problems: Hard and Easy Problems. InIJCAI-95, pages 631–637

  • H. Fargier, T. Schiex, G. Verfaille
  • 1995
Highly Influential
15 Excerpts

Meseguer . On the relation among open , interactive and dynamic CSP

  • M. Milano, R. Cucchiara, M. Gavanelli, M. Piccardi
  • The Fifth Workshop on Modelling and Solving…
  • 2005

Similar Papers

Loading similar papers…