Author of the publication

08421 Working Group: Imprecision, Diversity and Uncertainty: Disentangling Threads in Uncertainty Management

, , , , , , and . Uncertainty Management in Information Systems, 08421, Dagstuhl, Germany, Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, Germany, (2009)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

 

Other publications of authors with the same name

A Theory of Keys for Temporal Databases.. BDA, page 35-54. INRIA, (1993)Temporal Dependencies Generalized for Spatial and Other Dimensions., and . Spatio-Temporal Database Management, volume 1678 of Lecture Notes in Computer Science, page 189-203. Springer, (1999)Consistent query answering under primary keys: a characterization of tractable queries.. ICDT, volume 361 of ACM International Conference Proceeding Series, page 42-52. ACM, (2009)A Survey of the Data Complexity of Consistent Query Answering under Key Constraints.. FoIKS, volume 8367 of Lecture Notes in Computer Science, page 62-78. Springer, (2014)On the Complexity of Mining Quantitative Association Rules., and . Data Min. Knowl. Discov., 2 (3): 263-281 (1998)An Approach towards the Study of Symmetric Queries., , , , and . Proc. VLDB Endow., 7 (1): 25-36 (2013)LinCQA: Faster Consistent Query Answering with Linear Time Guarantees., , , and . Proc. ACM Manag. Data, 1 (1): 38:1-38:25 (2023)Condensed Representation of Database Repairs for Consistent Query Answering. ICDT '03: Proceedings of the 9th International Conference on Database Theory, page 378--393. London, UK, Springer-Verlag, (2002)Consistent Query Answering for Primary Keys and Conjunctive Queries with Counting., and . ICDT, volume 255 of LIPIcs, page 23:1-23:19. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2023)Special issue on Temporal Representation and Reasoning (TIME 2017)., , and . Theor. Comput. Sci., (2019)