Encoding preference queries to an uncertain database in possibilistic answer set programming
MetadataShow full item 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.