dc.contributor.author |
Koehler, H |
en |
dc.contributor.author |
Leck, U |
en |
dc.contributor.author |
Link, Sebastian |
en |
dc.contributor.author |
Prade, H |
en |
dc.contributor.editor |
Ferme, E |
en |
dc.contributor.editor |
Leite, J |
en |
dc.coverage.spatial |
Funchal, Madeira, Portugal |
en |
dc.date.accessioned |
2015-03-25T03:26:36Z |
en |
dc.date.issued |
2014-09 |
en |
dc.identifier.citation |
Proceedings of the 14th European Conference on Logics in Artificial Intelligence, Lecture Notes in Computer Science, 2014, 8761 pp. 181 - 195 |
en |
dc.identifier.isbn |
978-3-319-11558-0 |
en |
dc.identifier.issn |
0302-9743 |
en |
dc.identifier.uri |
http://hdl.handle.net/2292/24952 |
en |
dc.description.abstract |
Possibility theory is applied to introduce and reason about the fundamental notion of a key for uncertain data. Uncertainty is modeled qualitatively by assigning to tuples of data a degree of possibility with which they occur in a relation, and assigning to keys a degree of certainty which says to which tuples the key applies. The associated implication problem is characterized axiomatically and algorithmically. It is shown how sets of possibilistic keys can be visualized as possibilistic Armstrong relations, and how they can be discovered from given possibilistic relations. It is also shown how possibilistic keys can be used to clean dirty data by revising the belief in possibility degrees of tuples. |
en |
dc.publisher |
Springer International Publishing |
en |
dc.relation.ispartof |
JELIA 2014 |
en |
dc.relation.ispartofseries |
Proceedings of the 14th European Conference on Logics in Artificial Intelligence, Lecture Notes in Computer Science |
en |
dc.rights |
Items in ResearchSpace are protected by copyright, with all rights reserved, unless otherwise indicated. Previously published items are made available in accordance with the copyright policy of the publisher. |
en |
dc.rights.uri |
https://researchspace.auckland.ac.nz/docs/uoa-docs/rights.htm |
en |
dc.title |
Logical Foundations of Possibilistic Keys |
en |
dc.type |
Conference Item |
en |
dc.identifier.doi |
10.1007/978-3-319-11558-0_13 |
en |
pubs.begin-page |
181 |
en |
pubs.volume |
8761 |
en |
dc.description.version |
AM - Accepted Manuscript |
en |
dc.rights.holder |
Copyright:
Springer International Publishing |
en |
pubs.end-page |
195 |
en |
pubs.finish-date |
2014-09-26 |
en |
pubs.start-date |
2014-09-24 |
en |
dc.rights.accessrights |
http://purl.org/eprint/accessRights/OpenAccess |
en |
pubs.subtype |
Conference Paper |
en |
pubs.elements-id |
464118 |
en |
pubs.org-id |
Science |
en |
pubs.org-id |
School of Computer Science |
en |
pubs.record-created-at-source-date |
2014-11-28 |
en |