Database preferences queries - A possibilistic logic approach with symbolic priorities

Publication Type:
Conference Proceeding
Citation:
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2008, 4932 LNCS pp. 291 - 310
Issue Date:
2008-08-27
Full metadata record
Files in This Item:
Filename Description Size
conf ppr.pdfPublished version5.42 MB
Adobe PDF
The paper presents a new approach to database preferences 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. Here, 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. © 2008 Springer-Verlag Berlin Heidelberg.
Please use this identifier to cite or link to this item: