On ordered weighted averaging aggregation operators in multicriteria decisionmaking
IEEE Transactions on Systems, Man and Cybernetics
Fuzzy sets as a basis for a theory of possibility
Fuzzy Sets and Systems
Top-k selection queries over relational databases: Mapping strategies and performance evaluation
ACM Transactions on Database Systems (TODS)
ICCS '00 Proceedings of the Linguistic on Conceptual Structures: Logical Linguistic, and Computational Issues
Soft Querying, a New Feature for Database Management Systems
DEXA '94 Proceedings of the 5th International Conference on Database and Expert Systems Applications
Preference formulas in relational queries
ACM Transactions on Database Systems (TODS)
Preference SQL: design, implementation, experiences
VLDB '02 Proceedings of the 28th international conference on Very Large Data Bases
Unifying practical uncertainty representations -- I: Generalized p-boxes
International Journal of Approximate Reasoning
Unifying practical uncertainty representations. II: Clouds
International Journal of Approximate Reasoning
Fuzzy Annotation of Web Data Tables Driven by a Domain Ontology
ESWC 2009 Heraklion Proceedings of the 6th European Semantic Web Conference on The Semantic Web: Research and Applications
Incremental controlled relaxation of failing flexible queries
Journal of Intelligent Information Systems
About Bipolar Division Operators
FQAS '09 Proceedings of the 8th International Conference on Flexible Query Answering Systems
Dealing with Positive and Negative Query Criteria in Fuzzy Database Querying
FQAS '09 Proceedings of the 8th International Conference on Flexible Query Answering Systems
Extending relational algebra to handle bipolarity
Proceedings of the 2010 ACM Symposium on Applied Computing
Handling bipolarity in elementary queries to possibilistic databases
IEEE Transactions on Fuzzy Systems - Special section on computing with words
SQLf: a relational database language for fuzzy querying
IEEE Transactions on Fuzzy Systems
Computers and Electronics in Agriculture
Hi-index | 0.20 |
In this paper, we propose an approach to query a database when the user preferences are bipolar (i.e., express both constraints and wishes about the desired result) and the data stored in the database are imprecise. Results are then completely ordered with respect to these bipolar preferences, giving priority to constraints over wishes. Additionally, we propose a treatment that allows us to guarantee that any query will return a result, even if no element satisfies all constraints specified by the user. Such a treatment may be useful when user's constraints are unrealistic (i.e., cannot be all satisfied simultaneously) and when the user desires a guaranteed result. The approach is illustrated on a real-world problem concerning the selection of optimal packaging for fresh fruits and vegetables.