A possibilistic logic view of preference queries to an uncertain database
- Publication Type:
- Conference Proceeding
- 2010 IEEE World Congress on Computational Intelligence, WCCI 2010, 2010
- Issue Date:
Copyright Clearance Process
- Recently Added
- In Progress
- Closed Access
This item is closed access and not available.
The paper shows how three different types of hierarchical queries involving qualitative preference and leading to totally ordered results, which have been recently considered in the setting of division operation, can be conveniently encoded in possibilistic logic. This enables such a handling of preference queries to be interfaced with a recently proposed approach for dealing with pieces of data associated with certainty levels represented in the framework of possibilistic logic. © 2010 IEEE.
Please use this identifier to cite or link to this item: