Conditional entailment: bridging two approaches to default reasoning
Artificial Intelligence
Preference-Based Search for Scheduling
Proceedings of the Seventeenth National Conference on Artificial Intelligence and Twelfth Conference on Innovative Applications of Artificial Intelligence
A cumulative-model semantics for dynamic preferences on assumptions
IJCAI'97 Proceedings of the 15th international joint conference on Artifical intelligence - Volume 1
Temporal constraint reasoning with preferences
IJCAI'01 Proceedings of the 17th international joint conference on Artificial intelligence - Volume 1
Preference-based configuration of web page content
IJCAI'01 Proceedings of the 17th international joint conference on Artificial intelligence - Volume 2
Graphical models for preference and utility
UAI'95 Proceedings of the Eleventh conference on Uncertainty in artificial intelligence
Preference programming: Advanced problem solving for configuration
Artificial Intelligence for Engineering Design, Analysis and Manufacturing
High-level synthesis for large bit-width multipliers on FPGAs: a case study
CODES+ISSS '05 Proceedings of the 3rd IEEE/ACM/IFIP international conference on Hardware/software codesign and system synthesis
Refining preference-based search results through Bayesian filtering
Proceedings of the 12th international conference on Intelligent user interfaces
Search for Compromise Solutions in Multiobjective State Space Graphs
Proceedings of the 2006 conference on ECAI 2006: 17th European Conference on Artificial Intelligence August 29 -- September 1, 2006, Riva del Garda, Italy
Local Computation Schemes with Partially Ordered Preferences
ECSQARU '09 Proceedings of the 10th European Conference on Symbolic and Quantitative Approaches to Reasoning with Uncertainty
QUICKXPLAIN: preferred explanations and relaxations for over-constrained problems
AAAI'04 Proceedings of the 19th national conference on Artifical intelligence
Propagate the right thing: how preferences can speed-up constraint solving
IJCAI'03 Proceedings of the 18th international joint conference on Artificial intelligence
Algebraic Markov decision processes
IJCAI'05 Proceedings of the 19th international joint conference on Artificial intelligence
PTIME: Personalized assistance for calendaring
ACM Transactions on Intelligent Systems and Technology (TIST)
Conditional lexicographic orders in constraint satisfaction problems
CPAIOR'06 Proceedings of the Third international conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
| Hi-index | 0.00 |
Many real-world AI problems (e.g. in configuration) are weakly constrained, thus requiring a mechanism for characterizing and finding the preferred solutions. Preference-based search (PBS) exploits preferences between decisions to focus search to preferred solutions, but does not efficiently treat preferences on defined criteria such as the total price or quality of a configuration. We generalize PBS to compute balanced, extreme, and Pareto-optimal solutions for general CSP's, thus handling preferences on and between multiple criteria. A master-PBS selects criteria based on trade-offs and preferences and passes them as optimization objective to a sub-PBS that performs a constraint-based Branch-and-Bound search. We project the preferences of the selected criterion to the search decisions to provide a search heuristics and to reduce search effort, thus giving the criterion a high impact on the search. The resulting method will particularly be effective for CSP's with large domains that arise if configuration catalogs are large.