Abstract
We consider soft constraint problems where some of the preferences may be unspecified. This models, for example, situations with several agents providing the data, or with possible privacy issues. In this context, we study how to find an optimal solution without having to wait for all the preferences. In particular, we define an algorithm to find a solution which is necessarily optimal, that is, optimal no matter what the missing data will be, with the aim to ask the user to reveal as few preferences as possible. Experimental results show that in many cases a necessarily optimal solution can be found without eliciting too many preferences.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Bistarelli, S., Montanari, U., Rossi, F.: Semiring-based constraint solving and optimization. Journal of the ACM 44(2), 201–236 (1997)
Bistarelli, S., Montanari, U., Rossi, F., Schiex, T., Verfaillie, G., Fargier, H.: Semiring-based CSPs and valued CSPs: Frameworks, properties, and comparison. Constraints 4(3) (1999)
Dechter, R.: Constraint processing. Morgan Kaufmann, San Francisco (2003)
Dechter, R., Dechter, A.: Belief maintenance in dynamic constraint networks. In: AAAI, pp. 37–42 (1988)
Faltings, B., Macho-Gonzalez, S.: Open constraint satisfaction. In: Van Hentenryck, P. (ed.) CP 2002. LNCS, vol. 2470, pp. 356–370. Springer, Heidelberg (2002)
Faltings, B., Macho-Gonzalez, S.: Open constraint optimization. In: Rossi, F. (ed.) CP 2003. LNCS, vol. 2833, pp. 303–317. Springer, Heidelberg (2003)
Faltings, B., Macho-Gonzalez, S.: Open constraint programming. Artif. Intell. 161(1-2), 181–208 (2005)
Fargier, H., Lang, J.: Uncertainty in constraint satisfaction problems: a probalistic approach. In: Moral, S., Kruse, R., Clarke, E. (eds.) ECSQARU 1993. LNCS, vol. 747, pp. 97–104. Springer, Heidelberg (1993)
Fargier, H., Schiex, T., Verfaille, G.: Valued Constraint Satisfaction Problems: Hard and Easy Problems. In: IJCAI 1995, pp. 631–637. Morgan Kaufmann, San Francisco (1995)
González, S.M., Ansótegui, C., Meseguer, P.: On the relation among open, interactive and dynamic CSP. In: The Fifth Workshop on Modelling and Solving Problems with Constraints (IJCAI 2005) (2005)
Lamma, E., Mello, P., Milano, M., Cucchiara, R., Gavanelli, M., Piccardi, M.: Constraint propagation and value acquisition: Why we should do it interactively. In: IJCAI, pp. 468–477 (1999)
Lang, J., Pini, M.S., Rossi, F., Venable, K.B., Walsh, T.: Winner determination in sequential majority voting. In: IJCAI, pp. 1372–1377 (2007)
Ruttkay, Z.: Fuzzy constraint satisfaction. In: Proceedings 1st IEEE Conference on Evolutionary Computing, Orlando, pp. 542–547 (1994)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Gelain, M., Pini, M.S., Rossi, F., Venable, K.B. (2007). Dealing with Incomplete Preferences in Soft Constraint Problems. In: Bessière, C. (eds) Principles and Practice of Constraint Programming – CP 2007. CP 2007. Lecture Notes in Computer Science, vol 4741. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-74970-7_22
Download citation
DOI: https://doi.org/10.1007/978-3-540-74970-7_22
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-74969-1
Online ISBN: 978-3-540-74970-7
eBook Packages: Computer ScienceComputer Science (R0)