Graph-Based Algorithms for Boolean Function Manipulation
IEEE Transactions on Computers
Tree clustering for constraint networks (research note)
Artificial Intelligence
Edge-valued binary decision diagrams for multi-level hierarchical verification
DAC '92 Proceedings of the 29th ACM/IEEE Design Automation Conference
DAC '94 Proceedings of the 31st annual Design Automation Conference
Verification of arithmetic circuits with binary moment diagrams
DAC '95 Proceedings of the 32nd annual ACM/IEEE Design Automation Conference
Improving the Variable Ordering of OBDDs Is NP-Complete
IEEE Transactions on Computers
Algebraic decision diagrams and their applications
ICCAD '93 Proceedings of the 1993 IEEE/ACM international conference on Computer-aided design
Fast Approximation Algorithms for the Knapsack and Sum of Subset Problems
Journal of the ACM (JACM)
Bucket elimination: a unifying framework for reasoning
Artificial Intelligence
Consistency restoriation and explanations in dynamic CSPs----application to configuration
Artificial Intelligence
Algorithms and Data Structures in VLSI Design
Algorithms and Data Structures in VLSI Design
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Factored Edge-Valued Binary Decision Diagrams
Formal Methods in System Design
A differential approach to inference in Bayesian networks
Journal of the ACM (JACM)
K*BMDs: A New Data Structure for Verification
EDTC '96 Proceedings of the 1996 European conference on Design and Test
On the Construction of Multiple-Valued Decision Diagrams
ISMVL '02 Proceedings of the 32nd International Symposium on Multiple-Valued Logic
Bucket elimination for multiobjective optimization problems
Journal of Heuristics
Handbook of Constraint Programming (Foundations of Artificial Intelligence)
Handbook of Constraint Programming (Foundations of Artificial Intelligence)
The practice of approximated consistency for Knapsack constraints
AAAI'04 Proceedings of the 19th national conference on Artifical intelligence
AAAI'06 Proceedings of the 21st national conference on Artificial intelligence - Volume 1
A BDD-based polytime algorithm for cost-bounded interactive configuration
AAAI'06 Proceedings of the 21st national conference on Artificial intelligence - Volume 1
AND/OR multi-valued decision diagrams (AOMDDs) for graphical models
Journal of Artificial Intelligence Research
Journal of Artificial Intelligence Research
On valued negation normal form formulas
IJCAI'07 Proceedings of the 20th international joint conference on Artifical intelligence
DPLL with a trace: from SAT to knowledge compilation
IJCAI'05 Proceedings of the 19th international joint conference on Artificial intelligence
Decision diagrams for the computation of semiring valuations
IJCAI'05 Proceedings of the 19th international joint conference on Artificial intelligence
IJCAI'05 Proceedings of the 19th international joint conference on Artificial intelligence
Multiobjective optimization using GAI models
IJCAI'09 Proceedings of the 21st international jont conference on Artifical intelligence
International Journal of Applied Mathematics and Computer Science
Construction of efficient BDDs for bounded arithmetic constraints
TACAS'03 Proceedings of the 9th international conference on Tools and algorithms for the construction and analysis of systems
Multi-objective and multi-constrained non-additive shortest path problems
Computers and Operations Research
Decision diagrams: fast and flexible support for case retrieval and recommendation
ECCBR'06 Proceedings of the 8th European conference on Advances in Case-Based Reasoning
Hi-index | 0.00 |
In many AI domains such as product configuration, a user should interactively specify a solution that must satisfy a set of constraints. In such scenarios, offline compilation of feasible solutions into a tractable representation is an important approach to delivering efficient backtrack-free user interaction online. In particular, binary decision diagrams (BDDs) have been successfully used as a compilation target for product and service configuration. In this paper we discuss how to extend BDD-based configuration to scenarios involving cost functions which express user preferences. We first show that an efficient, robust and easy to implement extension is possible if the cost function is additive, and feasible solutions are represented using multi-valued decision diagrams (MDDs). We also discuss the effect on MDD size if the cost function is non-additive or if it is encoded explicitly into MDD. We then discuss interactive configuration in the presence of multiple cost functions. We prove that even in its simplest form, multiple-cost configuration is NP-hard in the input MDD. However, for solving two-cost configuration we develop a pseudo-polynomial scheme and a fully polynomial approximation scheme. The applicability of our approach is demonstrated through experiments over real-world configuration models and product-catalogue datasets. Response times are generally within a fraction of a second even for very large instances.