.png){kind=icon}
.png){kind=icon}
Return
Preference-based search and multi-criteria optimization
.png){kind=icon}
OA
AI
DOI：10.1023/B:ANOR.0000032571.68051.fe.png)
.png){kind=icon}
.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
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 global criteria such as the total price or quality of a configuration. We generalize PBS to compute balanced, extreme, and Pareto- optimal solutions for general CSPs, thus handling preferences on and between multiple criteria. A master- PBS selects criteria based on trade- offs and preferences and passes them as an 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 heuristic and to reduce search effort, thus giving the criterion a high impact on the search. The resulting method will be particularly effective for CSPs with large domains that arise if configuration catalogues are large.
Keywords:
preferences
nonmonotonic reasoning
constraint satisfaction
multi-criteria optimization
search
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
4.5
Papers:
8.0K
Citations:
2.1W
Organization
No organization information available