( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
On the data complexity of consistent query answering.

, , и . ICDT, стр. 22-33. ACM, (2012)

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.

Gaëlle Calvary

Gaëlle Debret

Gaëlle Garet

Gaëlle Letort

Gaëlle Rivory

 

Другие публикации лиц с тем же именем

Some modal aspects of XPath., , и . J. Appl. Non Class. Logics, 20 (3): 139-171 (2010)Continuous Fragment of the mu-Calculus.. CSL, том 5213 из Lecture Notes in Computer Science, стр. 139-153. Springer, (2008)Querying Incomplete Graphs with Data., и . AMW, том 1189 из CEUR Workshop Proceedings, CEUR-WS.org, (2014)An Easy Completeness Proof for the Modal mu-Calculus on Finite Trees., и . FICS, стр. 30-38. Institute of Cybernetics, (2009)On the Data Complexity of Consistent Query Answering., , и . Theory Comput. Syst., 57 (4): 843-891 (2015)On the Data Complexity of Consistent Query Answering over Graph Databases., и . ICDT, том 31 из LIPIcs, стр. 380-397. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2015)Why Is It Hard to Obtain a Dichotomy for Consistent Query Answering?. ACM Trans. Comput. Log., 16 (1): 7:1-7:24 (2015)On the data complexity of consistent query answering., , и . ICDT, стр. 22-33. ACM, (2012)Some model theory for the modal μ-calculus: syntactic characterisations of semantic properties., и . Logical Methods in Computer Science, (2018)Vietoris Bisimulations., , и . J. Log. Comput., 20 (5): 1017-1040 (2010)