Encoding preference queries to an uncertain database in possibilistic answer set programming

Publication Type:
Conference Proceeding
Communications in Computer and Information Science, 2012, 297 CCIS (PART 1), pp. 511 - 520
Issue Date:
Filename Description Size
Thumbnail2013007829OK.pdf Published version350.89 kB
Adobe PDF
Full metadata record
The representation of preference queries to an uncertain data-base requires a framework capable of dealing with preferences and uncertainty in a separate way. Possibilistic logic has shown to be a suitable setting to support different kinds of preference queries. In this paper, we propose a counterpart of the possibilistic logic-based preference query encoding within a possibilistic logic programming framework. Our approach is capable of dealing with the same interplay of preferences and uncertainty as in possibilistic logic. © 2012 Springer-Verlag Berlin Heidelberg.
Please use this identifier to cite or link to this item: