Preference programming: Advanced problem solving for configuration

Artificial Intelligence for Engineering Design, Analysis and Manufacturing: AIEDAM

Volumn 17, Issue 1, 2003, Pages 13-29

  Junker, Ulrich ^a   Mailharro, Daniel ^a  

^a IBM   (United States)

Author keywords

Configuration; Constraint programming; Preferences; Search

Indexed keywords

CONSTRAINT THEORY; DATABASE SYSTEMS; FORMAL LANGUAGES; PROBLEM SOLVING;

CONSISTENCY CHECKING; PREFERENCE PROGRAMMING;

PROGRAMMING THEORY;

EID: 0038204580     PISSN: 08900604     EISSN: None     Source Type: Journal    
DOI: 10.1017/S089006040317103X     Document Type: Article

References (23)

1. Bistarelli, S., Montanari, U., Rossi, R., Schiex, T., Verfaillie, G., & Fargier, H. (1999). Semiring-based CSPs and valued CSPs: Frameworks, properties, and comparison. Constraints 4(3), 199-240.
2. Boutilier, C., Brafman, R., Geib, C., & Poole, D. (1997). A constraint-based approach to preference elicitation and decision making. In Working Papers of the AAAI Spring Symposium on Qualitative Preferences in Deliberation and Practical Reasoning (Doyle, J., & Thomason, R. H., Eds.), pp. 19-28, Menlo Park, CA: AAAI Press.
3. Brewka, G. (1989) Preferred subtheories: An extended logical theory for default reasoning. Proc. Eleventh Int. Joint Conf. Artificial Intelligence (Sridharan, N.S., Ed.), pp. 1043-1048. San Mateo, CA: Morgan Kaufmann.
4. Brewka, G. (1994). Reasoning about priorities in default logic. Proc. Twelfth National Conf. Artificial Intelligence (AAAI), pp. 940-945. Menlo Park, CA: AAAI Press.
5. Delgrande, J.P., & Schaub, T. (2000). Expressing preferences in default logic. Artificial Intelligence 123(1-2), 41-87.
6. Domshlak, C., Brafman, R.I., & Shimony, S.E. (2001). Preference-based configuration of web page content. Proc. Seventeenth Int. Joint Conf. Artificial Intelligence, pp. 1451-1456, San Francisco, CA: Morgan Kaufmann.
7. Doyle, J. (2002). Preferences: Some problems and prospects. In AAAI-02 Workshop on Preferences in AI and CP: Symbolic Approaches. Menlo Park: AAAI Press.
8. Ehrgott, M. (1997). A characterization of lexicographic max-ordering solutions. Methods of Multicriteria Decision Theory: Proceedings of the 6th Workshop of the DGOR Working-Group Multicriteria Optimization and Decision Theory, pp. 193-202. Egelsbach, Germany: Häsel-Hohenhausen.
9. Freuder, E.C. (1991). Eliminating interchangeable values in constraint satisfaction problems. Proc. Ninth National Conf. Artificial Intelligence (AAAI) (Dean, K., & McKeown, T.L., Eds.), pp. 227-233. Cambridge, MA: MIT Press.
10. Haselböck, A., & Stumptner, M. (1993). An integrated approach for modelling complex configuration domains. 13th Int. Conf. Expert Systems, AI, and Natural Language, Avignon, France, pp. 625-634.
11. ILOG. (2002) ILOG JConfiguration V2.0: Product information. Available on-line at www.ilog.com/products/jconfigurator/.
12. Junker, U. (1993) Dynamic generation of assumptions and preferences. In Actes des Vièmes du Journées du Laboratoire d'Informatique de Paris Nord (Bidoit, N., Ed.), pp. 1-21. Paris: Villetaneuse.
13. Junker, U. (1997) A cumulative-model semantics for dynamic preferences on assumptions. Proc. Fifteenth Int. Joint Conf. Artificial Intelligence, pp. 162-167. San Francisco, CA: Morgan Kaufmann.
14. Junker, U. (2000). Preference-based search for scheduling. Proc. Seventeenth National Conf. Artificial Intelligence (AAAI), pp. 904-909. Menlo Park, CA: AAAI Press.
15. Junker, U. (2002). Preference-based search and multi-criteria optimization. Proc. Eighteenth National Conf. Artificial Intelligence (AAAI), pp. 34-40. Menlo Park, CA: AAAI Press.
16. Mailharro, D. (1998). A classification and constraint based framework for configuration. Artificial Intelligence for Engineering Design, Analysis and Manufacturing 12(4), 383-397.
17. Mittal, S., & Frayman, F. (1989). Towards a generic model of configuration tasks. Proc. Eleventh Int. Joint Conf. Artificial Intelligence (Sridharan, N.S., Ed.), pp. 1395-1401. San Mateo, CA: Morgan Kaufmann.
18. Poole, D. (1988). A logical framework for default reasoning. Artificial Intelligence 36(1), 27-47.
19. Puget, J.-F. (1992). Object-oriented constraint programming. Artificial Intelligence, Expert Systems, Natural Language: Twelfth Int. Conf., pp. 129-138, Avignon, France.
20. SABRE. (2002). Sabre trip shopping: Product information. Available online at www.sabretravelnetwork.com/products_and_services/travel_agencies/sl_000999.htm.
21. Soininen, T., Niemelä, I., Tiihonen, J., & Sulonen, R. (2000). Unified configuration knowledge representation using weight constraint rules. ECAI-2000 Workshop on Configuration, Berlin, pp. 79-84.
22. Torrens, M., & Faltings, B. (2002). Using soft CSPs for approximating Pareto-optimal solutions sets. AAAI-02 Workshop on Preferences in AI and CP: Symbolic Approaches. Menlo Park, CA: AAAI Press.
23. van Hentenryck, P., & Puget, J.-F. (2000). Search and strategies in OPL. ACMTCL: ACM Transactions on Computational Logic 1.