Sciweavers

Share
SEBD
2008

Profiling Sets for Preference Querying

8 years 3 months ago
Profiling Sets for Preference Querying
We propose a logical framework for set preferences. Candidate sets are represented using profiles consisting of scalar features. This reduces set preferences to tuple preferences over set profiles. We also give a heuristic algorithm for the computation of the "best" sets.
Xi Zhang, Jan Chomicki
Added 30 Oct 2010
Updated 30 Oct 2010
Type Conference
Year 2008
Where SEBD
Authors Xi Zhang, Jan Chomicki
Comments (0)
books