Combining totalitarian and ceteris paribus semantics in database preference queries

Logic Journal of the IGPL

Volumn 18, Issue 3, 2009, Pages 464-483

  da Silva Neves, Rui ^a   Kaci, Souhila ^b  

^a UNIVERSITÉ TOULOUSE JEAN JAURÈS   (France)

^b UNIV LILLE   (France)

Author keywords

Database queries; Preferences

Indexed keywords

QUERY LANGUAGES;

CETERIS PARIBUS; COMPARATIVE PREFERENCE STATEMENTS; DATABASE QUERIES; NON-MONOTONIC REASONING; PREFERENCE; PREFERENCES QUERIES; SIMPLE++; UNIFIED FRAMEWORK; USER REQUIREMENTS;

SEMANTICS;

EID: 77957263087     PISSN: 13670751     EISSN: 13689894     Source Type: Journal    
DOI: 10.1093/jigpal/jzp056     Document Type: Article

References (21)

1. S. Benferhat, D. Dubois, and H. Prade. Towards a possibilistic logic handling of preferences. Applied Intelligence, 14(3):303-317, 2001.
2. S. Benferhat and S. Kaci. A possibilistic logic handling of strong preferences. In Proceedings of 19th International Fuzzy Systems Association (IFSA'01), pages 962-967, 2001.
3. S. Börzsönyi, D. Kossmann, and K. Stocker. The skyline operator. In Proceedings of the 17th International Conference on Data Engineering (ICDE'01), pages 421-430, 2001.
4. C. Boutilier, R.I. Brafman, H.H. Hoos, and D. Poole. Reasoning with conditional ceteris paribus preference statements. In Proceedings of 15th Conference on Uncertainty in Artificial Intelligence (UAI'99), pages 71-80, 1999.
5. C. Boutilier, R. Brafman, C. Domshlak, H. Hoos, and D. Poole. CP-nets: A tool for representing and reasoning with conditional ceteris paribus preference statements. Journal of Artificial Intelligence Research, 21:135-191, 2004.
6. R.I. Brafman and C. Domshlak. Database preference queries revisited. In Technical Report TR2004-1934, Cornell University, Computing and Information Science, 2004.
7. N. Bruno, S. Chaudhuri, and L. Gravano. Top-k selection queries over relational databases: Mapping strategies and performance evaluation. ACM Transactions on Database Systems, 27(2):153-187, 2002.
8. C.L. Chang. Deduce - a deductive query language for relational data base. In Pattern Recognition and Artificial Intelligence, pages 108-112, 1976.
9. J. Chomicki. Querying with intrinsic preferences. In Proceedings of the 18th International Conference on Data Engineering (ICDE'02), pages 34-51, 2002.
10. J. Chomicki. Preference formulas in relational queries. ACM transactions on Database Systems, 28(4):1-40, 2003.
11. P.C. Fishburn. Preference structures and their numerical representations. Theoretical Computer Science, 217(2):359-383, 1999.
12. S. Kaci and L. van der Torre. Reasoning with various kinds of preferences: Logic, non-monotonicity, and algorithms. Annals of Operation Research, 163(1):89-114, 2008.
13. W. Kiessling. Foundations of preferences in database systems. In 28th International Conference on Very Large Data Bases (VLDB'02), pages 311-322, 2002.
14. S. Lichtenstein and P. Slovic. Reversals of preference between bids and choices in gambling decisions. Journal of Experimental Psychology, 89(1):46-55, 1971.
15. H.R. Lindman. Inconsistent preferences among gambles. Journal of Experimental Psychology, 89(2):390-397, 1971.
16. A. Motro. Supporting goal queries in relational database. In ICEDS'86, pages 85-96, 1986.
17. L. Sjoberg. Uncertainty of comparative judgments and multidimensional structure. Multivariate Behavioral Research, 10(2):207-218, 1975.
18. R. Torlone and P. Ciaccia. Finding the best when it's a matter of preference. In SEBD, pages 347-360, 2002.
19. A. Tversky. Intransitivity of preference. Psychological Review, 76:31-48, 1969.
20. N. Wilson. Extending cp-nets with stronger conditional preference statements. In Proceedings of the 19th National Conference on Artificial Intelligence (AAAI'04), pages 735-741, 2004.
21. R.R. Yager. Entropy and specificity in a mathematical theory of evidence. International Journal of General Systems, 9:249-260, 1983.