Logic Journal of IGPL Advance Access published online on November 6, 2009
Logic Journal of IGPL, doi:10.1093/jigpal/jzp056
Combining totalitarian and Ceteris Paribus semantics in database preference queries
CLLE, MDR, Université Toulouse-II, 5 Allées Machado, 31058 Toulouse Cedex 9, France.
E-mail: neves{at}univ-tlse2.fr
Université Lille-Nord de France, Artois, CRIL, CNRS UMR 8188 - IUT de Lens, F-62307, France.
E-mail: kaci{at}cril.fr
Preference queries from databases aim to retrieve the best answers w.r.t. user's requirements. The integration of preferences in database queries has known many advances in the last decade. Most of works however are based on comparative preference statements obeying more or less strong semantics. Representing and reasoning about comparative preference statements has also been widely investigated in Artificial Intelligence. In this paper, we bridge the two frameworks and develop a simple and unified framework to reason about preferences in database queries. Our framework is based on insights from non-monotonic reasoning.
Key Words: Preferences database queries
References
-
[1] Benferhat S, Dubois D, Prade H. Towards a possibilistic logic handling of preferences. Applied Intelligence (2001) 14(3):303–317.[CrossRef][Web of Science]
[2] Benferhat S. A possibilistic logic handling of strong preferences. In. In: Proceedings of 19th International Fuzzy Systems Association (IFSA01) (2001) 962–967.
[3] Börzsönyi S, Kossmann D, Stocker K. The skyline operator. In. In: Proceedings of the 17th International Conference on Data Engineering (ICDE01) (2001) 421–430.
[4] Boutilier C, Brafman RI, Hoos HH, Poole D. Reasoning with conditional ceteris paribus preference statements. (1999) 71–80. In Proceedings of 15th Conference on Uncertainty in Artificial Intelligence (UAI99).
[5] Boutilier C, Brafman R, Domshlak C, Hoos H, Poole D. CP-nets: A tool for representing and reasoning with conditional ceteris paribus preference statements. Journal of Artificial Intelligence Research (2004) 21:135–191.[Web of Science]
[6] Brafman RI, Domshlak C. Database preference queries revisited. In: Technical Report TR2004-1934, Cornell University, Computing and Information Science (2004).
[7] Bruno N, Chaudhuri S, Gravano L. Top-k selection queries over relational databases: Mapping strategies and performance evaluation. ACM Transactions on Database Systems (2002) 27(2):153–187.[CrossRef][Web of Science]
[8] Chang CL. Deduce – a deductive query language for relational data base. In: Pattern Recognition and Artificial Intelligence (1976) 108–112.
[9] Chomicki J. Querying with intrinsic preferences. (2002) 34–51. In Proceedings of the 18th International Conference on Data Engineering (ICDE02).
[10] Chomicki J. Preference formulas in relational queries. ACM transactions on Database Systems (2003) 28(4):1–40.[CrossRef][Web of Science]
[11] Fishburn PC. Preference structures and their numerical representations. Theoretical Computer Science (1999) 217(2):359–383.[CrossRef][Web of Science]
[12] Kaci S, van der Torre L. Reasoning with various kinds of preferences: Logic, nonmonotonicity, and algorithms. Annals of Operation Research (2008) 163(1):89–114.[CrossRef]
[13] Kiessling W. Foundations of preferences in database systems. (2002) 311–322. In 28th International Conference on Very Large Data Bases (VLDB02).
[14] Lichtenstein S, Slovic P. Reversals of preference between bids and choices in gambling decisions. Journal of Experimental Psychology (1971) 89(1):46–55.[CrossRef][Web of Science]
[15] Lindman HR. Inconsistent preferences among gambles. Journal of Experimental Psychology (1971) 89(2):390–397.[CrossRef][Web of Science]
[16] Motro A. Supporting goal queries in relational database. In: ICEDS86 (1986) 85–96.
[17] Sjoberg L. Uncertainty of comparative judgments and multidimensional structure. Multivariate Behavioral Research (1975) 10(2):207–218.[CrossRef][Web of Science]
[18] Torlone R, Ciaccia P. Finding the best when it's a matter of preference. In: SEBD (2002) 347–360.
[19] Tversky A. Intransitivity of preference. Psychological Review (1969) 76:31–48.[CrossRef][Web of Science]
[20] Wilson N. Extending cp-nets with stronger conditional preference statements. (2004) 735–741. In Proceedings of the 19th National Conference on Artificial Intelligence (AAAI04).
[21] Yager RR. Entropy and specificity in a mathematical theory of evidence. International Journal of General Systems (1983) 9:249–260.[CrossRef][Web of Science]
| ||||||||||||||||||||||||||||||||||||||||||||||||