A possibilistic logic view of preference queries to an uncertain database

2010 IEEE World Congress on Computational Intelligence, WCCI 2010

Volumn , Issue , 2010, Pages

  Bosc, Patrick ^a   Pivert, Olivier ^a   Prade, Henri ^b  

^a CAMPUS DE BEAULIEU   (France)

^b UNIVERSITÉ DE TOULOUSE   (France)

Author keywords

[No Author keywords available]

Indexed keywords

HIERARCHICAL QUERIES; POSSIBILISTIC LOGIC; PREFERENCE QUERIES; UNCERTAIN DATABASE;

ARTIFICIAL INTELLIGENCE;

QUERY LANGUAGES;

EID: 78549286328     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/FUZZY.2010.5584028     Document Type: Conference Paper

References (27)

1. A. HadjAli, S. Kaci, and H. Prade, "Database preferences queries - a possibilistic logic approach with symbolic priorities," in Proc. 5th Int. Symp. on Foundations of Information and Knowledge Systems (FoIKS 2008), (S. Hartmann, G. Kern-Isberner, eds.), Pisa, Feb. 11-15, LNCS 4932, Springer, 2008, pp. 291-310.
2. N. Bruno, S. Chaudhuri, and L. Gravano, "Top-k selection queries over relational databases: mapping strategies and performance evaluation," ACM Trans. on Database Systems, vol. 27, pp. 153-187, 2002.
3. P. Bosc and O. Pivert, "SQLf : a relational database language for fuzzy querying," IEEE Trans. on Fuzzy Systems, vol. 3, pp. 1-17, 1995.
4. R. Agrawal and E. Wimmers, "A framework for expressing and combining preferences," in Proc. of SIGMOD'00, 2000, pp. 297-306.
5. P. Fishburn, "Preferences structures and their numerical representation," Theoretical Computer Science, vol. 217, pp. 359-383, 1999.
6. J. Chomicki, "Preference formulas in relational queries," ACM Transactions on Database Systems, vol. 28, no. 4, pp. 427-466, 2003.
7. M. Lacroix and P. Lavency, "Preferences: putting more knowledge into queries," in Proc. of the 13th Conference on Very Large Data Bases (VLDB'87), 1987, pp. 217-225.
8. R. I. Brafman and C. Domshlak, "Database preference queries revisited," in Technical Report TR2004-1934, Cornell University, Computing and Information Science, 2004.
9. W. Kießling and G. Köstler, "Preference SQL - design, implementation, experiences," in Proc. of the 28th Conference on Very Large Data Bases (VLDB'02), 2002, pp. 990-1001.
10. S. B?orzs?onyi, D. Kossmann, and K. Stocker, "The skyline operator," in Proc. of the 17th IEEE Inter. Conf. on Data Engineering (ICDE'01), 2001, pp. 421-430.
11. L. Antova, T. Jansen, C. Koch, and D. Olteanu, "Fast and simple processing of uncertain data," in Proc. of 24th Int. Conf. on Data Engineering (ICDE'08), 2008, pp. 983-992.
12. O. Benjelloun, A. Das Sarma, A. Halevy, M. Theobald, and J. Widom, "Databases with uncertainty and lineage," VLDB Journal, vol. 17, no. 2, pp. 243-264, 2008.
13. N. Dalvi and D. Suciu, "Management of probabilistic data: Foundations and challenges," in Proc. of PODS 2007, 2007, pp. 1-12.
14. L. Zadeh, "Fuzzy sets as a basis for a theory of possibility," Fuzzy Sets and Systems, vol. 1, no. 1, pp. 3-28, 1978.
15. H. Prade and C. Testemale, "Generalizing database relational algebra for the treatment of incomplete/uncertain information and vague queries," Information Sciences, vol. 34, no. 2, pp. 115-143, 1984.
16. P. Bosc and O. Pivert, "About projection-selection-join queries addressed to possibilistic relational databases," IEEE Trans. on Fuzzy Systems, vol. 13, no. 1, pp. 124-139, 205.
17. P. Bosc, O. Pivert, and H. Prade, "A model based on possibilistic certainty levels for incomplete databases," in Proc. of the 3rd International Conference on Scalable Uncertainty Management (SUM'09), Washington DC, USA, 2009, pp. 80-94.
18. P. Bosc, O. Pivert, and O. Soufflet, "On three classes of division queries involving ordinal preferences," in Proc. of the 18th International Symposium on Methodologies for Intelligent Systems (ISMIS'09), LNAI 5722, Prague, Czech Republic, 2009, pp. 311-320.
19. D. Dubois, J. Lang, and H. Prade, "Automated reasoning using possibilistic logic: Semantics, belief revision, and variable certainty weights," IEEE Trans. on Knowledge and Data Engineering, vol. 6, pp. 64-71, 1994.
20. S. Benferhat and H. Prade, "Compiling possibilistic knowledge bases," in European Conference on Artificial Intelligence (ECAI), Riva del Garda, Italy, 29/08/2006-01/09/2006, G. Brewka, S. Coradeschi, A. Perini, and P. Traverso, Eds. IOS Press, 2006, pp. 337-341.
21. D. Dubois and H. Prade, "Necessity measures and the resolution principle," IEEE Trans. Syst., Man, Cyber., vol. 17, pp. 474-478, 1987.
22. C. Green, "Theorem-proving by resolution as a basis for questionanwering systems," in Machine Intelligence, Vol. 4, D. Michie and B. Meltzer, Eds. Edinburgh University Press, 1969, pp. 183-25.
23. G. Brewka, S. Benferhat, and D. Le Berre, "Qualitative choice logic," Artificial Intelligence, vol. 157, pp. 203-237, 2004.
24. S. Benferhat, G. Brewka, and D. Le Berre, "On the relation between qualitative choice logic and possibilistic logic," in Proc. 10th International Conference IPMU, 2004, pp. 951-957.
25. H. Prade, "Current Research Trends in Possibilistic Logic: Multiple Agent Reasoning, Preference Representation, and Uncertain Database," in Advances in Data Management, Z. W. Ras and A. Dardzinska, Eds. Springer, 2009, pp. 311-330.
26. D. Dubois and H. Prade, Possibility Theory. NewYork: Plenum, 1988.
27. D. Dubois, D. Le Berre, H. Prade, and R. Sabbadin, "Using possibilistic logic for modeling qualitative decision: ATMS-based algorithms," Fundamenta Informaticae, vol. 37, pp. 1-30, 1999.