Database preference queries-a possibilistic logic approach with symbolic priorities

Publication Type:
Journal Article
Citation:
Annals of Mathematics and Artificial Intelligence, 2011, 63 (3-4), pp. 357 - 383
Issue Date:
2011-12-01
Full metadata record
Files in This Item:
Filename Description Size
Final published version.pdfPublished Version431.34 kB
Adobe PDF
The paper presents a new approach to database preference queries, where preferences are represented in a possibilistic logic manner, using symbolic weights. The symbolic weights may be processed without assessing their precise value, which leaves the freedom for the user to not specify any priority among the preferences. The user may also enforce a (partial) ordering between them, if necessary. The approach can be related to the processing of fuzzy queries whose components are conditionally weighted in terms of importance. In this paper, importance levels are symbolically processed, and refinements of both Pareto ordering and minimum ordering are used. The representational power of the proposed setting is stressed, while the approach is compared with database Best operator-like methods and with the CP-net approach developed in artificial intelligence. The paper also provides a structured and rather broad overview of the different lines of research in the literature dealing with the handling of preferences in database queries. © 2012 Springer Science+Business Media B.V.
Please use this identifier to cite or link to this item: