A model based on possibilistic certainty levels for incomplete databases

Publication Type:
Conference Proceeding
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2009, 5785 LNAI pp. 80 - 94
Issue Date:
Full metadata record
Files in This Item:
Filename Description Size
Thumbnail2013007796OK.pdf Published version319.43 kB
Adobe PDF
This paper deals with the modeling and querying of a database containing uncertain attribute values, in the situation where some knowledge is available about the more or less certain value (or disjunction of values) that a given attribute in a given tuple can take. This is represented in the setting of possibility theory. A relational database model suited to this context is introduced, and selection, join and union operators of relational algebra are extended so as to handle such relations. It is shown that i) the model in question is a strong representation system for the algebraic operators considered, and that ii) the data complexity associated with the extended operators in this context is the same as in the classical database case, which makes the approach highly scalable. A possibilistic logic encoding of the model is also outlined. © 2009 Springer Berlin Heidelberg.
Please use this identifier to cite or link to this item: