A Possibilistic Logic Approach to Conditional Preference Queries

Didier Dubois (1, 2) , Henri Prade (1, 2) , Fayçal Touazi (3)

1 IRIT-ADRIA - Argumentation, Décision, Raisonnement, Incertitude et Apprentissage
2 CNRS - Centre National de la Recherche Scientifique
3 IRIT - Institut de recherche en informatique de Toulouse

The paper presents a new approach to deal with database preference queries, where preferences are represented in the style of possibilistic logic, using symbolic weights. The symbolic weights may be processed without the need of a numerical assignment of priority. Still, it is possible to introduce a partial ordering among the symbolic weights if necessary. On this basis, four methods that have an increasing discriminating power for ranking the answers to conjunctive queries, are proposed. The approach is compared to different lines of research in preference queries including skyline-based methods and fuzzy set-based queries. With the four proposed ranking methods the first group of best answers is made of non dominated items. The purely qualitative nature of the approach avoids the commensurability requirement of elementary evaluations underlying the fuzzy logic methods.

Mots clés: Logic

Domaines: Intelligence artificielle [cs.AI]; Apprentissage [cs.LG]; Logique en informatique [cs.LO]; Informatique et langage [cs.CL]

Didier Dubois, Henri Prade, Fayçal Touazi. A Possibilistic Logic Approach to Conditional Preference Queries. 10th International Conference Flexible Query Answering (FQAS 2013), Sep 2013, Granada, Spain. pp. 376-388. ⟨hal-01212939⟩