Interactive cost configuration over decision diagrams

Journal of Artificial Intelligence Research

Volumn 37, Issue , 2010, Pages 99-139

  Andersen, Henrik Reif ^a   Hadzic, Tarik ^b   Pisinger, David ^c  

^a Configit A/S ^*  (Denmark)

^b UNIVERSITY COLLEGE CORK   (Ireland)

^c TECHNICAL UNIVERSITY OF DENMARK   (Denmark)

Author keywords

[No Author keywords available]

Indexed keywords

CONFIGURATION MODEL; COST CONFIGURATION; DATA SETS; DECISION DIAGRAM; FEASIBLE SOLUTION; NON-ADDITIVE; NP-HARD; OFFLINE; PRODUCT AND SERVICES; PRODUCT CONFIGURATION; REAL-WORLD; RESPONSE TIME; USER INTERACTION;

BINARY DECISION DIAGRAMS; COSTS; DECISION THEORY; POLYNOMIAL APPROXIMATION; USER INTERFACES;

COST FUNCTIONS;

EID: 77952712886     PISSN: None     EISSN: 10769757     Source Type: Journal    
DOI: 10.1613/jair.2905     Document Type: Article

References (59)

1. Amilhastre, J., Fargier, H., & Marquis, P. (2002). Consistency Restoration and Explanations in Dynamic CSPs-Application to Configuration. Artificial Intelligence, 135 (1-2), 199-234.
2. Bahar, R., Frohm, E., Gaona, C., Hachtel, E., Macii, A., Pardo, A., & Somenzi, F. (1993). Algebraic decision diagrams and their applications. In IEEE/ACM International Con- ference on CAD, pp. 188-191.
3. Bartzis, C., & Bultan, T. (2003). Construction of efficient BDDs for bounded arithmetic constraints. In Garavel, H., & Hatcliff, J. (Eds.), TACAS, Vol.2619 of Lecture Notes in Computer Science, pp. 394-408. Springer.
4. Bodlaender, H. L. (1993). A tourist guide through treewidth. Acta Cybernetica, 11, 1-23.
5. Bollig, B., & Wegener, I. (1996). Improving the variable ordering of OBDDs is NP-complete. Computers, IEEE Transactions on, 45 (9), 993-1002.
6. Bryant, R. E. (1986). Graph-Based Algorithms for Boolean Function Manipulation. IEEE Transactions on Computers, 35, 677-691.
7. Bryant, R. E., & Chen, Y.-A. (1995). Verification of Arithmetic Circuits with Binary Moment Diagrams. In In Proceedings of the 32nd ACM/IEEE Design Automation Conference, pp. 535-541.
8. Darwiche, A., & Marquis, P. (2002). A Knowledge Compilation Map. Journal of Artificial Intelligence Research, 17, 229-264.
9. Darwiche, A. (2002). A Logical Approach to Factoring Belief Networks. In Fensel, D., Giunchiglia, F., McGuinness, D., & Williams, M.-A. (Eds.), KR2002: Principles of Knowledge Representation and Reasoning, pp. 409-420 San Francisco, California. Morgan Kaufmann.
10. Darwiche, A. (2003). A differential approach to inference in Bayesian networks. Journal of the ACM, 50 (3), 280-305.
11. Dechter, R. (1999). Bucket Elimination: A Unifying Framework for Reasoning. Artificial Intelligence, 113 (1-2), 41-85.
12. Dechter, R., & Pearl, J. (1989). Tree-Clustering for Constraint Networks. Artificial Intelligence, 38 (3), 353-366.
13. Drechsler, R., Sarabi, A., Theobald, M., Becker, B., & Perkowski, M. A. (1994). Efficient representation and manipulation of switching functions based on ordered Kronecker functional decision diagrams. In DAC '94: Proceedings of the 31st annual conference on Design automation, pp. 415-419 New York, NY, USA. ACM.
14. Drechsler, R. (2001). Binary decision diagrams in theory and practice. International Journal on Software Tools for Technology Transfer (STTT), 3 (2), 112-136.
15. Drechsler, R., Becker, B., & Ruppertz, S. (1996). K*BMDs: A New Data Structure for Verification. In EDTC '96: Proceedings of the 1996 European conference on Design and Test, p. 2 Washington, DC, USA. IEEE Computer Society.
16. Dubus, J.-P., Gonzales, C., & Perny, P. (2009). Multiobjective Optimization using GAI Models. In Boutilier, C. (Ed.), IJCAI, pp. 1902-1907.
17. Ehrgott, M., & Gandibleux, X. (2000). A Survey and Annotated Bibliography of Multiobjective Combinatorial Optimization. OR Spektrum, 22, 425-460.
18. Fahle, T., & Sellmann, M. (2002). Cost Based Filtering for the Constrained Knapsack Problem. Annals of Operations Research, 115, 73-93.
19. Fargier, H., & Marquis, P. (2006). On the Use of Partially Ordered Decision Graphs in Knowledge Compilation and Quantified Boolean Formulae. In Proceedings of AAAI 2006, pp. 42-47.
20. Fargier, H., & Marquis, P. (2007). On Valued Negation Normal Form Formulas. In Pro- ceedings of IJCAI 2007, pp. 360-365.
21. Fargier, H., & Vilarem, M.-C. (2004). Compiling CSPs into Tree-Driven Automata for Interactive Solving. Constraints, 9 (4), 263-287.
22. Figueira, J. R., Greco, S., & Ehrgott, M. (2005). Multiple Criteria Decision Analysis: State of the Art Surveys. Springer Verlag, Boston, Dordrecht, London.
23. Garey, M. R., & Johnson, D. S. (1979). Computers and Intractability-A Guide to the Theory of NP-Completeness. W H Freeman & Co.
24. Hadzic, T., Subbarayan, S., Jensen, R. M., Andersen, H. R., Møller, J., & Hulgaard, H. (2004). Fast Backtrack-Free Product Configuration using a Precompiled Solution Space Representation. In In Proceedings of PETO Conference, pp. 131-138. DTUtryk.
25. Hadzic, T., & Andersen, H. R. (2006). A BDD-based Polytime Algorithm for Cost-Bounded Interactive Configuration. In Proceedings of AAAI 2006, pp. 62-67.
26. Hadzic, T., Hansen, E. R., & O'Sullivan, B. (2008). On Automata, MDDs and BDDs in Constraint Satisfaction. In Proceedings of the ECAI 2008 Workshop on Inference Methods based on Graphical Structures of Knowledge.
27. Huang, J., & Darwiche, A. (2004). Using DPLL for efficient OBDD construction. In Proceedings of SAT 2004, pp. 127-136.
28. Huang, J., & Darwiche, A. (2005). DPLL with a trace: From SAT to knowledge compilation. In Kaelbling, L. P., & Saffiotti, A. (Eds.), IJCAI, pp. 156-162. Professional Book Center.
29. Ibarra, O., & Kim, C. (1975). Fast approximation algorithms for the knapsack and sum of subset problem. Journal of the ACM, 22, 463-468.
30. Jensen, R. M. (2007). CLab: A C++ library for fast backtrack-free interactive product configuration. http://www.itu.dk/people/rmj/clab/.
31. Kebschull, U., & Rosenstiel, W. (1993). Efficient graph-based computation and manipulation of functional decision diagrams. Design Automation, 1993, with the European Event in ASIC Design. Proceedings. [4th] European Conference on, 278-282.
32. Kellerer, H., Pferschy, U., & Pisinger, D. (2004). Knapsack Problems. Springer, Berlin, Germany.
33. Lai, Y.-T., & Sastry, S. (1992). Edge-valued binary decision diagrams for multi-level hierarchical verification. In DAC '92: Proceedings of the 29th ACM/IEEE conference on Design automation, pp. 608-613 Los Alamitos, CA, USA. IEEE Computer Society Press.
34. Lichtenberg, J., Andersen, H. R., Hulgaard, H., Møller, J., & Rasmussen, A. S. (2001). Method of configuring a product. US Patent No: 7,584,079.
35. Lind-Nielsen, J. (2001). BuDDy - A Binary Decision Diagram Package. http://sourceforge.net/projects/buddy.
36. Mateescu, R., Dechter, R., & Marinescu, R. (2008). AND/OR Multi-Valued Decision Diagrams (AOMDDs) for Graphical Models. Journal of Artificial Intelligence Research, 33, 465-519.
37. Meinel, C., & Theobald, T. (1998). Algorithms and Data Structures in VLSI Design. Springer.
38. Meseguer, P., Rossi, F., & Shiex, T. (2006). Soft constraints. In Rossi, F., van Beek, P., & Walsh, T. (Eds.), Handbook of Constraint Programming, Foundations of Artificial Intelligence, chap. 9, pp. 281-328. Elsevier Science Publishers, Amsterdam, The Netherlands.
39. Miller, D. M., & Drechsler, R. (2002). On the Construction of Multiple-Valued Decision Diagrams. In Proceedings of the 32nd International Symposium on Multiple-Valued Logic (ISMVL'02), p. 245 Washington, DC, USA. IEEE Computer Society.
40. Møller, J., Andersen, H. R., & Hulgaard, H. (2002). Product configuration over the internet. In INFORMS Conference on Information Systems and Technology.
41. Müller-Hannemann, M., & Weihe, K. (2001). Pareto Shortest Paths is Often Feasible in Practice. In WAE '01: Proceedings of the 5th International Workshop on Algorithm Engineering, pp. 185-198 London, UK. Springer-Verlag.
42. Nicholson, R., Bridge, D. G., & Wilson, N. (2006). Decision Diagrams: Fast and Flexible Support for Case Retrieval and Recommendation. In Proceedings of ECCBR 2006, pp. 136-150.
43. Pargamin, B. (2003). Extending Cluster Tree Compilation with non-Boolean variables in Product Configuration: a Tractable Approach to Preference-based Configuration. In IJCAI'03 Workshop on Configuration.
44. Reinhardt, L. B., & Pisinger, D. (2009). Multi-Objective and Multi-Constrained Non- Additive Shortest Path Problems. Computers and Operations Research. Submitted. Technical report version available at: http://man.dtu.dk/upload/institutter/ipl/publ/publikationer%202009/rapport%2016. pdf.
45. Rollón, E., & Larrosa, J. (2006). Bucket elimination for multiobjective optimization problems. Journal of Heuristics, 12 (4-5), 307-328.
46. Sanner, S., & McAllester, D. A. (2005). Affine Algebraic Decision Diagrams (AADDs) and their Application to Structured Probabilistic Inference. In Proceedings of IJCAI 2005, pp. 1384-1390.
47. Schuurman, P., & Woeginger, G. J. (2005). Approximation schemes - a tutorial. In Moehring, R., Potts, C., Schulz, A., Woeginger, G., & Wolsey, L. (Eds.), Lectures on Scheduling. Forthcoming.
48. Sellmann, M. (2004). The Practice of Approximated Consistency for Knapsack Constraints. In McGuinness, D. L., & Ferguson, G. (Eds.), AAAI, pp. 179-184. AAAI Press / The MIT Press.
49. Somenzi, F. (1996). CUDD: Colorado university decision diagram package. ftp://vlsi.colorado.edu/pub/.
50. Srinivasan, A., Kam, T., Malik, S., & Brayton, R. K. (1990). Algorithms for discrete function manipulation. In International Conference on CAD, pp. 92-95.
51. Subbarayan, S., Jensen, R. M., Hadzic, T., Andersen, H. R., Hulgaard, H., & Møller, J. (2004). Comparing two implementations of a complete and backtrack-free interactive configurator. In Proceedings of CP'04 CSPIA Workshop, pp. 97-111.
52. Subbarayan, S. M. (2008). On Exploiting Structures for Constraint Solving. Ph.D. thesis, IT University of Copenhagen, Copenhagen.
53. Tafertshofer, P., & Pedram, M. (1997). Factored edge-valued binary decision diagrams. In Formal Methods in System Design, Vol.10, pp. 243-270. Kluwer.
54. Tarapata, Z. (2007). Selected multicriteria shortest path problems: An analysis of complexity, models and adaptation of standard algorithms. International Journal of Applied Mathematics and Computer Science, 17 (2), 269-287.
55. Trick, M. (2001). A dynamic programming approach for consistency and propagation for knapsack constraints. In 3rd international workshop on integration of AI and OR techniques in constraint programming for combinatorial optimization problems CP- AI-OR, pp. 113-124.
56. Vempaty, N. R. (1992). Solving constraint satisfaction problems using finite state automata. In Proceedings of the Tenth National Conference on Artificial Intelligence, pp. 453- 458.
57. Walsh, T. (2000). SAT v CSP. In Dechter, R. (Ed.), Proceedings of CP 2000, Lecture Notes in Computer Science, pp. 441-456.
58. Wegener, I. (2000). Branching Programs and Binary Decision Diagrams. Society for Industrial and Applied Mathematics (SIAM).
59. Wilson, N. (2005). Decision diagrams for the computation of semiring valuations. In Proceedings of the Nineteenth International Joint Conference on Artificial Intelligence (IJCAI-05), pp. 331-336.