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.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Agrawal, R., Wimmers, E.L.: A framework for expressing and combining preferences. In: Proc. ACM SIGMOD, pp. 297–306 (2000)
Benferhat, S., Brewka, G., Le Berre, D.: On the relation between qualitative choice logic and possibilistic logic. In: Proc. 10th International Conference IPMU, pp. 951–957 (2004)
Benferhat, S., Dubois, D., Prade, H.: Towards a possibilistic logic handling of preferences. Applied Intelligence 14, 303–317 (2001)
Benferhat, S., Prade, H.: Encoding formulas with partially constrained weights in a possibilistic-like many-sorted propositional logic. In: IJCAI 2005. Proc. of the 9th Inter. Joint Conference on Artificiel Intelligence, pp. 1281–1286 (2005)
Börzsönyi, S., Kossmann, D., Stocker, K.: The skyline operator. In: Proc. 17th IEEE International Conference on Data Engineering, pp. 421–430 (2001)
Bosc, P., Pivert, O.: Some approaches for relational databases flexible querying. Journal of Intelligent Information Systems 1, 323–354 (1992)
Boutilier, C., Brafman, R.I., Domshlak, C., Hoos, H., Poole, D.: CP-nets: A tool for representing and reasoning with conditional ceteris paribus preference statements. J. Artificial Intelligence Reasoning (JAIR) 21, 135–191 (2004)
Brafman, R.I., Domshlak, C.: Database preference queries revisited. Technical Report TR2004-1934, Cornell University, Computing and Information Science (2004)
Brewka, G., Benferhat, S., Le Berre, D.: Qualitative choice logic. Artificial Intelligence 157, 203–237 (2004)
Chomicki, J.: Preference formulas in relational queries. ACM Transactions on Database Systems 28, 1–40 (2003)
Chomicki, J.: Database querying under changing preferences. Annals of Mathematics and Artificial Intelligence 50, 79–109 (2007)
Ciaccia, P.: Querying databases with incomplete cp-nets. In: M-PREF 2007. Multidisciplinary Workshop on Advances in Preference Handling (2007)
Domshlak, C., Venable, B., Rossi, F.: Reasoning about soft constraints and conditional preferences. In: IJCAI 2003. Proc. 18th International Joint Conference on Artificial Intelligence, pp. 215–220 (2003)
Dubois, D., Fargier, H., Prade, H.: Beyond min aggregation in multicriteria decision (ordered) weighted min, discri-min, leximin. In: Yager, R.R., Kacprzyk, J. (eds.) The Ordered Weighted Averaging Operators - Theory and Applications, pp. 181–192. Kluwer Acad. Publ., Dordrecht (1997)
Dubois, D., Prade, H.: Using fuzzy sets in flexible querying: Why and how? In: Andreasen, T., Christiansen, H., Larsen, H. (eds.) Flexible Query Answering Systems, pp. 45–60 (1997)
Dubois, D., Prade, H.: Bipolarity in flexible querying. In: Andreasen, T., Motro, A., Christiansen, H., Larsen, H.L. (eds.) FQAS 2002. LNCS (LNAI), vol. 2522, pp. 174–182. Springer, Heidelberg (2002)
Dubois, D., Prade, H.: Possibilistic logic: A retrospective and prospective view. Fuzzy Sets and Systems 144, 3–23 (2004)
Fishburn, P.C.: Preferences structures and their numerical representation. Theoretical Computer Science 217, 359–383 (1999)
Godfrey, P., Ning, W.: Relational preferences queries via stable skyline. Technical Report CS-2004-03, York University, pp. 1–14 (2004)
Kaci, S., Prade, H.: Relaxing ceteris paribus preferences with partially ordered priorities. In: Mellouli, K. (ed.) ECSQARU 2007. LNCS (LNAI), vol. 4724, pp. 660–671. Springer, Heidelberg (2007)
Kiessling, W.: Foundations of preferences in database systems. In: Bressan, S., Chaudhri, A.B., Lee, M.L., Yu, J.X., Lacroix, Z. (eds.) VLDB 2002. LNCS, vol. 2590, pp. 311–322. Springer, Heidelberg (2003)
Lacroix, M., Lavency, P.: Preferences: Putting more knowledge into queries. In: VLDB 1987. Proc. of the 13th Inter. Conference on Very Large Databases, pp. 217–225 (1987)
Lang, J.: From preferences to combinatorial vote. In: Proc. of KR Conferences, pp. 277–288 (2002)
Motro, A.: A user interface to relational databases that permits vague queries. ACM Transactions on Information Systems 6, 187–214 (1988)
Torlone, R., Ciaccia, P.: Finding the best when it’s a matter of preference. In: SEBD 2002. Proc. 10th Italian National Conference on Advanced Data Base Systems, pp. 347–360 (2002)
Wilson, N.: Extending CP-nets with stronger conditional preference statements. In: AAAI 2004. Proc. 19th National Conference on Artificial Intelligence, pp. 735–741 (2004)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2008 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Hadjali, A., Kaci, S., Prade, H. (2008). Database Preferences Queries – A Possibilistic Logic Approach with Symbolic Priorities. In: Hartmann, S., Kern-Isberner, G. (eds) Foundations of Information and Knowledge Systems. FoIKS 2008. Lecture Notes in Computer Science, vol 4932. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-77684-0_20
Download citation
DOI: https://doi.org/10.1007/978-3-540-77684-0_20
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-77683-3
Online ISBN: 978-3-540-77684-0
eBook Packages: Computer ScienceComputer Science (R0)