Pages that link to "Item:Q646519"
From MaRDI portal
The following pages link to Computational techniques for a simple theory of conditional preferences (Q646519):
Displaying 12 items.
- Parameterized ceteris paribus preferences over atomic conjunctions under conservative semantics (Q507531) (← links)
- Expressive efficiency of two kinds of specific CP-nets (Q527168) (← links)
- A behavioral choice model when computational ability matters (Q702813) (← links)
- Conditional lexicographic orders in constraint satisfaction problems (Q846134) (← links)
- Incremental evaluation of continuous preference queries (Q2195389) (← links)
- Possibilistic preference networks (Q2198214) (← links)
- Revisiting conditional preferences: from defaults to graphical representations (Q2297766) (← links)
- Explaining robust additive utility models by sequences of preference swaps (Q2362181) (← links)
- Hard and soft constraints for reasoning about qualitative conditional preferences (Q2506235) (← links)
- Modeling Ceteris Paribus Preferences in Formal Concept Analysis (Q4924394) (← links)
- Computing simple mechanisms: Lift-and-round over marginal reduced forms (Q6083525) (← links)
- An extended knowledge compilation map for conditional preference statements-based and generalized additive utilities-based languages (Q6630721) (← links)