Pages that link to "Item:Q2506235"
From MaRDI portal
The following pages link to Hard and soft constraints for reasoning about qualitative conditional preferences (Q2506235):
Displaying 17 items.
- Database preference queries -- a possibilistic logic approach with symbolic priorities (Q429433) (← links)
- A distributed social choice protocol for combinatorial domains (Q524881) (← links)
- Interval-valued soft constraint problems (Q616770) (← links)
- Computational techniques for a simple theory of conditional preferences (Q646519) (← links)
- Elicitation strategies for soft constraint problems with missing preferences: properties, algorithms and experimental studies (Q969536) (← links)
- Learning conditional preference networks (Q991013) (← links)
- Comparing the notions of optimality in CP-nets, strategic games and soft constraints (Q1029586) (← links)
- A hybrid framework for over-constrained generalized resource-constrained project scheduling problems (Q1768898) (← links)
- Residuation for soft constraints: lexicographic orders and approximation techniques (Q2055790) (← links)
- Reasoning with various kinds of preferences: logic, non-monotonicity, and algorithms (Q2271867) (← links)
- A logic of soft constraints based on partially ordered preferences (Q2506231) (← links)
- Hard and soft constraints for reasoning about qualitative conditional preferences (Q2506235) (← links)
- A rewriting logic framework for soft constraints (Q2873783) (← links)
- Representing and Reasoning with Qualitative Preferences: Tools and Applications (Q3463651) (← links)
- Relaxing Ceteris Paribus Preferences with Partially Ordered Priorities (Q3524976) (← links)
- A Comparison of the Notions of Optimality in Soft Constraints and Graphical Games (Q5302720) (← links)
- Compact representation of preferences (Q6602221) (← links)
