A possibilistic logic approach to conditional preference queries

Publication Type:
Conference Proceeding
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2013, 8132 LNAI pp. 376 - 388
Issue Date:
Full metadata record
Files in This Item:
Filename Description Size
Thumbnail2013007799OK.pdf Published version354.4 kB
Adobe PDF
The paper presents a new approach to deal with database preference queries, where preferences are represented in the style of possibilistic logic, using symbolic weights. The symbolic weights may be processed without the need of a numerical assignment of priority. Still, it is possible to introduce a partial ordering among the symbolic weights if necessary. On this basis, four methods that have an increasing discriminating power for ranking the answers to conjunctive queries, are proposed. The approach is compared to different lines of research in preference queries including skyline-based methods and fuzzy set-based queries. With the four proposed ranking methods the first group of best answers is made of non dominated items. The purely qualitative nature of the approach avoids the commensurability requirement of elementary evaluations underlying the fuzzy logic methods. © 2013 Springer-Verlag Berlin Heidelberg.
Please use this identifier to cite or link to this item: