Conditional Preferences: A New Semantics for Database Queries.

摘要: Preference queries aim to retrieve from large databases those objects that better match user’s requirements. Approaches proposed so far in the DB field for specifying preferences are limited when one needs consider conditional, rather than absolute, (e.g., I prefer driving by car winter, and motorbike summer), which common context-aware applications. CP-nets a powerful formalism concisely representing such preferences, has its roots decision making problems. However, CP-nets, being based on ceteris paribus (all else equal) interpretation, hardly applicable complex scenarios. In this paper we introduce new totalitarian (i.e., not paribus) semantics CP-nets. We prove our is equivalent complete acyclic whereas it avoids some counterintuitive effects of CP-net partially specified.