( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Querying graph patterns.

, , и . PODS, стр. 199-210. ACM, (2011)

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.

Pedro Barceló

Marianne Häuptle-Barceló

Juan Caldentey Barceló

Carlos Barceló Pérez

Pablo Robert

 

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

A Practical Query Language for Graph DBs, , и . 7th Alberto Mendelzon International Workshop on Foundations of Data Management (AMW), (2103)Graph Logics with Rational Relations: The Role of Word Combinatorics., и . ACM Trans. Comput. Log., 18 (2): 10:1-10:41 (2017)Expressive Path Queries on Graphs with Data., , и . LPAR, том 8312 из Lecture Notes in Computer Science, стр. 71-85. Springer, (2013)Logic Programs for Querying Inconsistent Databases., и . PADL, том 2562 из Lecture Notes in Computer Science, стр. 208-222. Springer, (2003)Semantic Acyclicity for Conjunctive Queries: Approximations and Constraints.. WoLLIC, том 9803 из Lecture Notes in Computer Science, стр. 104-108. Springer, (2016)Locally Consistent Transformations and Query Answering in Data Exchange., , , и . PODS, стр. 229-240. ACM, (2004)A Symbolic Language for Interpreting Decision Trees., , , , и . CoRR, (2023)Monadic Decomposability of Regular Relations., , , , и . ICALP, том 132 из LIPIcs, стр. 103:1-103:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2019)Explainability Queries for ML Models and its Connections with Data Management Problems (Invited Talk).. ICDT, том 186 из LIPIcs, стр. 1:1-1:1. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2021)Model Interpretability through the lens of Computational Complexity., , , и . NeurIPS, (2020)