Affiliation:
1. University M’hamed Bougara
Abstract
AbstractBecause of the rise in data volume of knowledge bases that are being published as a result of Open Data initiatives, new approaches are required to assist users in locating the items that most closely matches their preference criteria. In many approaches, the user is called to supply quantitative weights that may not be known in advance to manage the ranking of results.Contrary to the quantitative technique, preference criteria are sometimes more intuitive and can be conveyed more readily under the qualitative approach. We are interested in this paper to the problem of evaluating SPARQL qualitative preference queries over user preferences in SPARQL. Many approaches address this problem based on different frameworks as CP-net, skyline, fuzzy set and top-k. This article outlines a novel approach for dealing with SPARQL preference queries, where preferences are represented through symbolic weights using the possibilistic logic framework. It is possible to manage symbolic weights without using numerical values where a partial ordering is used instead. This approach is compared to numerous other approaches, including those based on skylines, fuzzy sets, and CP-nets.
Publisher
Research Square Platform LLC
Reference112 articles.
1. Dubois, Didier and Prade, Henri and Touazi, Fay{\c{c}}al (2013) Conditional Preference-nets, possibilistic logic, and the transitivity of priorities. Springer, 175--184, International Conference on Innovative Techniques and Applications of Artificial Intelligence
2. S. Benferhat and H. Prade (2005) Encoding formulas with partially constrained weights in a possibilistic-like many-sorted propositional logic. IJCAI-05, Proc. 19th Inter. Joint Conf. on Artificial Intelligence, Edinburgh, July 30-Aug. 5, L. Pack Kaelbling and A. Saffiotti, 1281--1286
3. J. Lang. Logique possibiliste : aspects formels, d{\'e}duction automatique et applications. RPDMP-TH-TN, 1991, Universit{\'e} Paul Sabatier Toulouse
4. Dubois, D. and Lang, J. and Prade, H. Possibilistic logic. In: Gabbay, D.M. and Hogger, C.J. and Robinson, J.A and Nute, D. (Eds.) Handbook of Logic in Artificial Intelligence and Logic Programming, Vol. 3, Oxford University Press, 1994, 439--513
5. R. Agrawal and E.L. Wimmers (2000) A framework for expressing and combining preferences. 297-306, Proc. ACM SIGMOD