Preferences in constraint satisfaction and optimization

AI Magazine

Volumn 29, Issue 4, 2008, Pages 58-68

  Rossi, Francesca ^a   Venable, Kristen Brent ^a   Walsh, Toby ^b  

^a UNIVERSITY OF PADOVA   (Italy)

^b UNIVERSITY OF NEW SOUTH WALES   (Australia)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER PROGRAMMING; LEARNING SYSTEMS;

AI TECHNIQUES; CONSTRAINT PROGRAMMING; CONSTRAINT SATISFACTION; CONSTRAINT-BASED; PREFERENCE ELICITATION; SOFT CONSTRAINT;

CONSTRAINT THEORY;

EID: 58649123902     PISSN: 07384602     EISSN: None     Source Type: Journal    
DOI: 10.1609/aimag.v29i4.2202     Document Type: Review

References (50)

1. Allen, J. F. 1983. Maintaining Knowledge about Temporal Intervals. Communications of the ACM 26(1): 832-843.
2. Amgoud, L.; Bonnefon, J.-F.; and Prade, H. 2005. An Argumentation-Based Approach to Multiple Criteria Decision. In Proceedings of the 8th European Conference on Symbolic and Quantitative Approaches to Reasoning with Uncertainty (ECSQARU 2005), volume 3571 of Lecture Notes in Computer Science, 269-280. Berlin: Springer.
3. Amilhastre, J.; Fargier, H.; and Marquis, P. 2002. Consistency Restoration and Explanations in Dynamic CSPs-Application to Configuration. Artificial Intelligence 135(12): 199-234.
4. Badaloni, S.; Falda, M.; and Giacomin, M. 2004. Integrating Quantitative and Qualitative Constraints in Fuzzy Temporal Networks. AI Communications 17(4): 183-272.
5. Benferhat, S.; Dubois, D.; Kaci, S.; and Prade, H. 2002. Bipolar Representation and Fusion of Preferences on the Possibilistic Logic Framework. In Proceedings of the Eight International Conference on Principles and Knowledge Representation and Reasoning (KR-02), 421-448. San Francisco: Morgan Kaufmann.
6. Benferhat, S.; Dubois, D.; Kaci, S.; and Prade, H. 2006. Bipolar Possibility Theory in Preference Modeling: Representation, Fusion, and Optimal Solutions. Information Fusion 7(1): 135-150.
7. Bistarelli, S.; Codognet, P.; and Rossi, F. 2002, Abstracting Soft Constraints: Framework, Properties, Examples. Artificial Intelligence 139(2): 175-211.
8. Bistarelli, S.; Montanari, U.; and Rossi, F. 1997. Semiring-Based Constraint Satisfaction and Optimization. Journal of the Association for Computing Machinery 44(2): 201-236.
9. Bistarelli, S.; Montanari, U.; Rossi, F.; Schiex, T.; Verfaillie, G.; and Fargier, H. 1999. Semiring-Based CSPs and Valued CSPs: Frameworks, Properties, and Comparison. Constraints 4(3): 199-240.
10. Bistarelli, S.; Pini, M. S.; Rossi, F.; and Venable, K. B. 2006. Bipolar Preference Problems: Framework, Properties, and Solving Techniques. In Recent Advances in Constraints (CSCLP 2006), volume 4651 of Lecture Notes in Computer Science, 78-92. Berlin: Springer.
11. Boutilier, C.; Brafman, R. I.; Domshlak, C.; Hoos, H. H.; and Poole, D. 2004. CP-Nets: A Tool for Representing and Reasoning with Conditional Ceteris Paribus Preference Statements. Journal of Artiflcial Intelligence Research (JAIR) 21: 135-191.
12. Brafman, R. I., and Dimopoulos, Y. 2004. A New Look at the Semantics and Optimization Methods of CP-Networks. Computational Intelligence 20(2): 218-245.
13. Chen, L., and Pu, P. 2004. Survey of Preference Elicitation Methods. Technical Report IC/200467, Swiss Federal Institute of Technology in Lausanne (EPFL). Lausanne, Switzerland.
14. Cousot, P., and Cousot, R. 1977. Abstract Interpretation: A Unified Lattice Model for Static Analysis of Programs by Construction or Approximation of Fixpoints. In Proceedings of the Fourth ACM Symposium on Principles of Programming Languages (POPL 1977), 238-252. New York: Association for Computing Machinery.
15. Dechter, R. 2003. Constraint Processing. San Francisco: Morgan Kaufmann Publishers.
16. Dechter, R.; Meiri, I.; and Pearl, J. 1991. Temporal Constraint Networks. Artificial Intelligence 49(1-3): 61-95.
17. Domshlak, C.; Rossi, F.; Venable, K. B.; and Walsh, T. 2003. Reasoning about Soft Constraints and Conditional Preferences: Complexity Results and Approximation Techniques. In Proceedings of the Eighteenth International Joint Conference on Artificial Intelligence (IJCAI 2003), 215-220. San Francisco: Morgan Kaufmann.
18. Dubois, D., and Fargier, H. 2005. On the Qualitative Comparison of Sets of Positive and Negative Affects. In Proceedings of the 8th European Conference on Symbolic and Quantitative Approaches to Reasoning with Uncertainty (ECSQARU 2005), volume 3571 of Lecture Notes in Computer Science, 305-316. Berlin: Springer.
19. Dubois, D., and Fargier, H. 2006. Qualitative Decision Making with Bipolar Information. In Proceedings of the Tenth International Conrerence on Principles of Knowledge Representation and Reasoning (KR-06), 175-186. Menlo Park, CA: AAAI Press.
20. Dubois, D.; Fargier, H.; and Prade, H. 1993. The Calculus of Fuzzy Restrictions as a Basis for Flexible Constraint Satisfaction. In Proceedings of the 2nd IEEE International Confererence on Fuzzy Systems. Piscataway, NJ: Institute of Electrical and Electronics Engineers.
21. Ehrgott, M., and Gandibleux, X., eds. 2002. Multiple Criteria Optimization. State of the Art Annotated Bibliographic Surveys. Dordrecht, Holland: Kluwer Academic.
22. Faltings, B., and Macho-Gonzalez, S. 2005. Open Constraint Programming. Artificial Intelligence 161(1-2): 181-208.
23. Fargier, H., and Lang, J. 1993. Uncertainty in Constraint Satisfaction Problems: A Probabilistic Approach. In Proceedings of the European Conference on Symbolic and Quantitative Approaches to Reasoning and Uncertainty (ECSQARU 1993), volume 747 of Lecture Notes in Computer Science, 97-104. Berlin: Springer.
24. Fargier, H.; Lang, J.; and Schiex, T. 1993. Selecting Preferred Solutions in Fuzzy Constraint Satisfaction Problems. In Proceedings of the First European Congress on Fuzzy and Intelligent Technologies (EUFIT-93). Aachen, Germany: Verlag der Augustinus Buchhandlung.
25. Freuder, E. C., and Sabin, D. 1997. Interchangeability Supports Abstraction and Reformulation for Multidimensional Constraint Satisfaction. In Proceedings of the Fourteenth National Conference on Artificial Intelligence (AAAI-97), 191-196. Menlo Park, CA: AAAI Press.
26. Freuder, E. C., and Wallace, R. J. 1992. Partial Constraint Satisfaction. Artificial Intelligence 58(1-3): 21-70.
27. Freuder, E. C.; Likitvivatanavong, C.; Moretti, M.; Rossi, F.; and Wallace, R. J. 2003. Computing Explanations and Implications in Preference-Based Configurators. In Recent Advances in Constraints (CSCLP 2003), volume 2627 of Lecture Notes in Computer Science, 76-92. Berlin: Springer.
28. Freuder, E. C.; Likitvivatanavong, C.; and Wallace, R. J. 2001. Deriving Explanations and Implications for Constraint Satisfaction Problems. In Proceedings of the 7th International Conference of Principles and Practice of Constraint Programming (CP 2001), volume 2239 of Lecture Notes in Computer Science, 58S-589. Berlin: Springer.
29. Gelain, M.; Pini, M. S.; Rossi, F.; and 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), volume 4741 of Lecture Notes in Computer Science, 286-300. Berlin: Springer.
30. Grabisch, M.; de Baets, B.; and Fodor, J. 2004. The Quest for Rings on Bipolar Scales. International Journal of Uncertainty, Fuzziness, and Knowledge-Based Systems 12(4): 499-512.
31. Junker, U. 2004. Quickxplain: Preferred Explanations and Relaxations for Over-Constrained Problems. In Proceedings of the Nineteenth National Conference on Artificial Intelligence (AAAI 2004), 167-172. Menlo Park, CA: AAAI Press.
32. Jussien, N., and Barichard, V. 2000. The PaLM System: Explanation-Based Constraint Programming. Paper presented at Techniques for Implementing Constraint Programming Systems, A Post-Conference Workshop of CP 2000, September 2000, Singapore, Singapore.
33. Khatib, L.; Morris, P. H.; Morris, R. A.; and Rossi, F. 2001. Temporal Constraint Reasoning with Preferences. In Proceedings of the Seventeenth International Joint Conference on Artificial Intelligence (IJCAI 2001), 322-327. San Francisco: Morgan Kaufmann.
34. Khatib, L.; Morris, P. H.; Morris, R.; Rossi, F.; Sperduti, A.; and Venable, K. B. 2007. Solving and Learning a Tractable Class of Soft Temporal Constraints: Theoretical and Experimental Results. AI Communications 20(3): 181-209.
35. Labreuche, C., and Grabisch, M. 2006. Generalized Choquet-like Aggregation Functions for Handling Bipolar Scales. European Journal of Operational Research 172(3): 931-955.
36. Lecoutre, C.; Merchez, S.; Boussemart, F.; and Grégoire, E. 2000. A CSP Abstraction Framework. In Proceedings of the 4th International Symposium on Abstraction, Reformulation, and Approximation (SARA 2000), volume 1864 of Lecture Notes in Computer Science. Berlin: Springer.
37. Meseguer, P.; Rossi, F.; and Schiex, T. 2006. Soft Constraints. In Handbook of Constraint Programming, ed. F. Rossi, P. Van Beek, and T. Walsh, chapter 9, 281-328. Amsterdam: Elsevier.
38. Michalowski, M.; Knoblock, C. A.; Bayer, K. M.; and Choueiry, B. Y. 2007. Exploiting Automatically Inferred Constraint-Models for Building Identification in Satellite Imagery. In Proceedings of the 15th ACM International Symposium on Geographic Information Systems (ACMGIS 2007), 6. New York: Association for Computing Machinery.
39. Moffitt, M. D., and Pollack, M. E. 2006. Temporal Preference Optimization as Weighted Constraint Satisfaction. In Proceedings of the Twenty-First National Conference on Artificial Intelligence (AAAI 2006). Menlo Park, CA: AAAI Press.
40. O'Connell, S.; O'Sullivan, B.; and Freuder, E. 2002. Strategies for Interactive Constraint Acquisition. In Proceedings of the 8th International Conference on Principles and Practice of Constraint Programming (CP 2002), volume 2470 of Lecture Notes in Computer Science. Berlin: Springer.
41. Peintner, B., and Pollack, M. E. 2004. Low-Cost Addition of Preferences to DTPs and TCSPs. In Proceedings of the Nineteenth National Conference on Artificial Intelligence (AAAI 2004), 723-728. Menlo Park, CA: AAAI Press.
42. Peintner, B., and Pollack, M. E. 2005. Anytime, Complete Algorithm for Finding Utilitarian Optimal Solutions to STPPs. In Proceedings of the Twentieth National Conference on Artificial Intelligence (AAAI 2005), 443-448. Menlo Park, CA: AAAI Press.
43. Prestwich, S. D.; Rossi, F.; Venable, K. B.; and Walsh, T. 2005. Constraint-Based Preferential Optimization. In Proceedings of the Twentieth National Conference on Artificial Intelligence, 461-466. Menlo Park, CA: AAAI Press.
44. Rossi, F., and Sperduti, A. 1998. Learning Solution Preferences in Constraint Problems. Journal of Experimental and Theoretical Artificial Intelligence 10(1): 103-116.
45. Rossi, F., and Sperduti, A. 2004. Acquiring Both Constraint and Solution Preferences in Interactive Constraint Systems. Constraints 9(4): 311-332.
46. Rossi, F.; Van Beek, P.; and Walsh, T., eds. 2006. Handbook of Constraint Programming. Amsterdam: Elsevier.
47. Ruttkay, Z. 1994. Fuzzy Constraint Satisfaction. In Proceedings of the Third IEEE International Conference on Fuzzy Systems. Piscataway, NJ: Institute of Electrical and Electronics Engineers.
48. Schiex, T.; Fargier, H.; and Verfaillie, G. 1995. Valued Constraint Satisfaction Problems: Hard and Easy Problems. In Proceedings of the Fourteenth International joint Conference on Artificial Intelligence (IJCAI 95), 631-639. San Francsico: Morgan Kaufmann Publishers.
49. Vu, X.-H., and O'Sullivan, B. 2007. Semiring-Based Constraint Acquisition. In Proceedings of the 19th IEEE International Conference on Tools with Artificial Intelligence (ICTAI 2007), 251-258. Los Alamitos, CA: IEEE Computer Society.
50. Wilson, N.; Grimes, D.; and Freuder, E. C. 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), volume 4741 of Lecture Notes in Computer Science, 666-680. Berlin: Springer.