VAGUE: a user interface to relational databases that permits vague queries
ACM Transactions on Information Systems (TOIS)
Epistemic entrenchment and possibilistic logic
Artificial Intelligence
Handbook of logic in artificial intelligence and logic programming (vol. 3)
Nonmonotonic reasoning, conditional objects and possibility theory
Artificial Intelligence
Beyond min aggregation in multicriteria decision: (ordered) weighted min, discri-min, leximin
The ordered weighted averaging operators
Using fuzzy sets in flexible querying: why and how?
Flexible query answering systems
Preference structures and their numerical representations
Theoretical Computer Science
A framework for expressing and combining preferences
SIGMOD '00 Proceedings of the 2000 ACM SIGMOD international conference on Management of data
Towards a Possibilistic Logic Handling of Preferences
Applied Intelligence
Bipolarity in Flexible Querying
FQAS '02 Proceedings of the 5th International Conference on Flexible Query Answering Systems
Proceedings of the 17th International Conference on Data Engineering
A general non-probabilistic theory of inductive reasoning
UAI '88 Proceedings of the Fourth Annual Conference on Uncertainty in Artificial Intelligence
Preferences; Putting More Knowledge into Queries
VLDB '87 Proceedings of the 13th International Conference on Very Large Data Bases
Preference formulas in relational queries
ACM Transactions on Database Systems (TODS)
Artificial Intelligence - Special issue on nonmonotonic reasoning
Database querying under changing preferences
Annals of Mathematics and Artificial Intelligence
Foundations of preferences in database systems
VLDB '02 Proceedings of the 28th international conference on Very Large Data Bases
Variable-strength conditional preferences for ranking objects in ontologies
Web Semantics: Science, Services and Agents on the World Wide Web
Optimal Preference Elicitation for Skyline Queries over Categorical Domains
DEXA '08 Proceedings of the 19th international conference on Database and Expert Systems Applications
Relaxing Ceteris Paribus Preferences with Partially Ordered Priorities
ECSQARU '07 Proceedings of the 9th European Conference on Symbolic and Quantitative Approaches to Reasoning with Uncertainty
Mastering the Processing of Preferences by Using Symbolic Priorities in Possibilistic Logic
Proceedings of the 2008 conference on ECAI 2008: 18th European Conference on Artificial Intelligence
Extending CP-nets with stronger conditional preference statements
AAAI'04 Proceedings of the 19th national conference on Artifical intelligence
Journal of Artificial Intelligence Research
IJCAI'03 Proceedings of the 18th international joint conference on Artificial intelligence
IJCAI'05 Proceedings of the 19th international joint conference on Artificial intelligence
Fuzzy dominance skyline queries
DEXA'07 Proceedings of the 18th international conference on Database and Expert Systems Applications
Qualitative integrals and desintegrals --- towards a logical view
MDAI'12 Proceedings of the 9th international conference on Modeling Decisions for Artificial Intelligence
Conditional preference nets and possibilistic logic
ECSQARU'13 Proceedings of the 12th European conference on Symbolic and Quantitative Approaches to Reasoning with Uncertainty
| Hi-index | 0.00 |
The paper presents a new approach to database preference queries, where preferences are represented in a possibilistic logic manner, using symbolic weights. The symbolic weights may be processed without assessing their precise value, which leaves the freedom for the user to not specify any priority among the preferences. The user may also enforce a (partial) ordering between them, if necessary. The approach can be related to the processing of fuzzy queries whose components are conditionally weighted in terms of importance. In this paper, importance levels are symbolically processed, and refinements of both Pareto ordering and minimum ordering are used. The representational power of the proposed setting is stressed, while the approach is compared with database Best operator-like methods and with the CP-net approach developed in artificial intelligence. The paper also provides a structured and rather broad overview of the different lines of research in the literature dealing with the handling of preferences in database queries.