Database preferences queries: a possibilistic logic approach with symbolic priorities

Authors:
Allel Hadjali;Souhila Kaci;Henri Prade
Affiliations:
IRISA/ENSSAT, Université Rennes I, Lannion Cedex, France;CRIL, IUT de Lens, Lens, France;IRIT, Université Paul Sabatier, Toulouse Cedex 9, France
Venue:
FoIKS'08 Proceedings of the 5th international conference on Foundations of information and knowledge systems
Year:
2008

Citing 17
Cited 17

VAGUE: a user interface to relational databases that permits vague queries

ACM Transactions on Information Systems (TOIS)
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
The Skyline Operator

Proceedings of the 17th International Conference on Data Engineering
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)
Qualitative choice logic

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
Extending CP-nets with stronger conditional preference statements

AAAI'04 Proceedings of the 19th national conference on Artifical intelligence
CP-nets: a tool for representing and reasoning with conditional ceteris paribus preference statements

Journal of Artificial Intelligence Research
Reasoning about soft constraints and conditional preferences: complexity results and approximation techniques

IJCAI'03 Proceedings of the 18th international joint conference on Artificial intelligence
Encoding formulas with partially constrained weights in a possibilistic-like many-sorted propositional logic

IJCAI'05 Proceedings of the 19th international joint conference on Artificial intelligence

Managing Uncertainty and Vagueness in Description Logics, Logic Programs and Description Logic Programs

Reasoning Web
Managing uncertainty and vagueness in description logics for the Semantic Web

Web Semantics: Science, Services and Agents on the World Wide Web
Stratified division queries involving ordinal user preferences

Proceedings of the 2009 ACM symposium on Applied Computing
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
Anti-division Queries with Ordinal Layered Preferences

ECSQARU '09 Proceedings of the 10th European Conference on Symbolic and Quantitative Approaches to Reasoning with Uncertainty
On Three Classes of Division Queries Involving Ordinal Preferences

ISMIS '09 Proceedings of the 18th International Symposium on Foundations of Intelligent Systems
A Flexible Querying Approach Based on Outranking and Classification

FQAS '09 Proceedings of the 8th International Conference on Flexible Query Answering Systems
Strict and tolerant antidivision queries with ordinal layered preferences

International Journal of Approximate Reasoning
Preferences in AI: An overview

Artificial Intelligence
A preference query model based on a fusion of local orders

ECSQARU'11 Proceedings of the 11th European conference on Symbolic and quantitative approaches to reasoning with uncertainty
On different types of fuzzy skylines

ISMIS'11 Proceedings of the 19th international conference on Foundations of intelligent systems
On database queries involving inferred fuzzy predicates

ISMIS'11 Proceedings of the 19th international conference on Foundations of intelligent systems
A fuzzy framework for selecting top-k web service compositions

ACM SIGAPP Applied Computing Review
On three classes of division queries involving ordinal preferences

Journal of Intelligent Information Systems
On possibilistic skyline queries

FQAS'11 Proceedings of the 9th international conference on Flexible Query Answering Systems
A fuzzy-rule-based approach to the handling of inferred fuzzy predicates in database queries

FQAS'11 Proceedings of the 9th international conference on Flexible Query Answering Systems
On a preference query language that handles symbolic scores

ADBIS'12 Proceedings of the 16th East European conference on Advances in Databases and Information Systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

The paper presents a new approach to database preferences 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. Here, 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.