Pablo Barceló

ORCID

Publication Activity (10 Years)

Years Active: 2001-2024
Publications (10 Years): 92

Top Venues

Publications

Matthias Lanzinger, Pablo Barceló
On the Power of the Weisfeiler-Leman Test for Graph Motif Parameters. ICLR (2024)
Xingyue Huang, Miguel A. Romero Orth, Pablo Barceló, Michael M. Bronstein, Ismail Ilkan Ceylan
Link Prediction with Relational Hypergraphs. CoRR (2024)
Pablo Barceló, Pierre Bourhis, Stefan Mengel, Sudeepa Roy
Representation, Provenance, and Explanations in Database Theory and Logic (Dagstuhl Seminar 24032). Dagstuhl Reports 14 (1) (2024)
Pablo Barceló, Alexander Kozachinskiy, Anthony Widjaja Lin, Vladimir V. Podolskii
Logical Languages Accepted by Transformer Encoders with Hard Attention. ICLR (2024)
Xingyue Huang, Miguel Romero, Ismail Ilkan Ceylan, Pablo Barceló
A Theory of Link Prediction via Relational Weisfeiler-Leman on Knowledge Graphs. NeurIPS (2023)
Matthias Lanzinger, Pablo Barceló
On the Power of the Weisfeiler-Leman Test for Graph Motif Parameters. CoRR (2023)
Marcelo Arenas, Pablo Barceló, Leopoldo E. Bertossi, Mikaël Monet
On the Complexity of SHAP-Score-Based Explanations: Tractability via Knowledge Compilation and Non-Approximability Results. J. Mach. Learn. Res. 24 (2023)
Valentino Delle Rose, Alexander Kozachinskiy, Cristóbal Rojas, Mircea Petrache, Pablo Barceló
Three iterations of (d-1)-WL test distinguish non isometric clouds of d-dimensional points. CoRR (2023)
Pablo Barceló, Diego Figueira, Rémi Morvan
Separating Automatic Relations. CoRR (2023)
Pablo Barceló, Tamara Cucumides, Floris Geerts, Juan L. Reutter, Miguel Romero
A neuro-symbolic framework for answering conjunctive queries. CoRR (2023)
Marcelo Arenas, Pablo Barceló, Diego Bustamente, Jose Caraball, Bernardo Subercaseaux
A Symbolic Language for Interpreting Decision Trees. CoRR (2023)
Pablo Barceló, Diego Figueira, Rémi Morvan
Separating Automatic Relations. MFCS (2023)
Pablo Barceló, Mauricio Duarte, Cristóbal Rojas, Tomasz Steifer
No Agreement Without Loss: Learning and Social Choice in Peer Review. ECAI (2023)
Pablo Barceló, Alexander Kozachinskiy, Anthony Widjaja Lin, Vladimir V. Podolskii
Logical Languages Accepted by Transformer Encoders with Hard Attention. CoRR (2023)
Xingyue Huang, Miguel A. Romero Orth, Ismail Ilkan Ceylan, Pablo Barceló
A Theory of Link Prediction via Relational Weisfeiler-Leman. CoRR (2023)
Valentino Delle Rose, Alexander Kozachinskiy, Cristobal Rojas, Mircea Petrache, Pablo Barceló
Three Iterations of (d - 1)-WL Test Distinguish Non Isometric Clouds of d-dimensional Points. NeurIPS (2023)
Pablo Barceló, Mikhail Galkin, Christopher Morris, Miguel A. Romero Orth
Weisfeiler and Leman Go Relational. CoRR (2022)
Pablo Barceló, Mikhail Galkin, Christopher Morris, Miguel A. Romero Orth
Weisfeiler and Leman Go Relational. LoG (2022)
Pablo Barceló, Nelson Higuera, Jorge Pérez, Bernardo Subercaseaux
On the expressiveness of Lara: A proposal for unifying linear and relational algebra. Theor. Comput. Sci. 935 (2022)
Pablo Barceló, Mauricio Duarte, Cristóbal Rojas, Tomasz Steifer
No Agreement Without Loss: Learning and Social Choice in Peer Review. CoRR (2022)
Marcelo Arenas, Pablo Barceló, Miguel Romero, Bernardo Subercaseaux
On Computing Probabilistic Explanations for Decision Trees. CoRR (2022)
Marcelo Arenas, Pablo Barceló, Miguel A. Romero Orth, Bernardo Subercaseaux
On Computing Probabilistic Explanations for Decision Trees. NeurIPS (2022)
Marcelo Arenas, Pablo Barceló, Mikaël Monet
The Complexity of Counting Problems Over Incomplete Databases. ACM Trans. Comput. Log. 22 (4) (2021)
Pablo Barceló, Marco Calautti
Special Issue on Database Theory. Theory Comput. Syst. 65 (1) (2021)
Marcelo Arenas, Daniel Baez, Pablo Barceló, Jorge Pérez, Bernardo Subercaseaux
Foundations of Symbolic Languages for Model Interpretability. NeurIPS (2021)
Jorge Pérez, Pablo Barceló, Javier Marinkovic
Attention is Turing-Complete. J. Mach. Learn. Res. 22 (2021)
Pablo Barceló, Floris Geerts, Juan L. Reutter, Maksimilian Ryschkov
Graph Neural Networks with Local Graph Parameters. NeurIPS (2021)
Pablo Barceló, Alexander Baumgartner, Victor Dalmau, Benny Kimelfeld
Regularizing conjunctive features for classification. J. Comput. Syst. Sci. 119 (2021)
Pablo Barceló, Floris Geerts, Juan L. Reutter, Maksimilian Ryschkov
Graph Neural Networks with Local Graph Parameters. CoRR (2021)
Marcelo Arenas, Daniel Baez, Pablo Barceló, Jorge Pérez, Bernardo Subercaseaux
Foundations of Symbolic Languages for Model Interpretability. CoRR (2021)
Pablo Barceló
Explainability Queries for ML Models and its Connections with Data Management Problems (Invited Talk). ICDT (2021)
Marcelo Arenas, Pablo Barceló, Leopoldo E. Bertossi, Mikaël Monet
The Tractability of SHAP-Score-Based Explanations for Classification over Deterministic and Decomposable Boolean Circuits. AAAI (2021)
Marcelo Arenas, Pablo Barceló, Leopoldo E. Bertossi, Mikaël Monet
On the Complexity of SHAP-Score-Based Explanations: Tractability via Knowledge Compilation and Non-Approximability Results. CoRR (2021)
Pablo Barceló, Egor V. Kostylev, Mikaël Monet, Jorge Pérez, Juan L. Reutter, Juan Pablo Silva
The Logical Expressiveness of Graph Neural Networks. ICLR (2020)
Marcelo Arenas, Pablo Barceló, Leopoldo E. Bertossi, Mikaël Monet
The Tractability of SHAP-scores over Deterministic and Decomposable Boolean Circuits. CoRR (2020)
Marcelo Arenas, Pablo Barceló, Mikaël Monet
The Complexity of Counting Problems over Incomplete Databases. CoRR (2020)
Pablo Barceló, Cristina Feier, Carsten Lutz, Andreas Pieris
When is Ontology-Mediated Querying Efficient? CoRR (2020)
Marcelo Arenas, Pablo Barceló
Chile's new interdisciplinary institute for foundational research on data. Commun. ACM 63 (11) (2020)
Pablo Barceló, Egor V. Kostylev, Mikaël Monet, Jorge Pérez, Juan L. Reutter, Juan Pablo Silva
The Expressive Power of Graph Neural Networks as a Query Language. SIGMOD Rec. 49 (2) (2020)
Marcelo Arenas, Pablo Barceló, Mikaël Monet
Counting Problems over Incomplete Databases. PODS (2020)
Pablo Barceló, Victor Dalmau, Cristina Feier, Carsten Lutz, Andreas Pieris
The Limits of Efficiency for Open- and Closed-World Query Evaluation Under Guarded TGDs. PODS (2020)
Pablo Barceló, Mikaël Monet, Jorge Pérez, Bernardo Subercaseaux
Model Interpretability through the lens of Computational Complexity. NeurIPS (2020)
Pablo Barceló, Mikaël Monet, Jorge Pérez, Bernardo Subercaseaux
Model Interpretability through the Lens of Computational Complexity. CoRR (2020)
Pablo Barceló, Miguel Romero, Thomas Zeume
A More General Theory of Static Approximations for Conjunctive Queries. Theory Comput. Syst. 64 (5) (2020)
Pablo Barceló, Gerald Berger, Carsten Lutz, Andreas Pieris
First-Order Rewritability of Frontier-Guarded Ontology-Mediated Queries. CoRR (2020)
Pablo Barceló, Diego Figueira, Georg Gottlob, Andreas Pieris
Semantic Optimization of Conjunctive Queries. J. ACM 67 (6) (2020)
Pablo Barceló, Nelson Higuera, Jorge Pérez, Bernardo Subercaseaux
On the Expressiveness of LARA: A Unified Language for Linear and Relational Algebra. ICDT (2020)
Pablo Barceló, Cristina Feier, Carsten Lutz, Andreas Pieris
When is Ontology-Mediated Querying Efficient? LICS (2019)
Pablo Barceló, Cristina Feier, Carsten Lutz, Andreas Pieris
PTime Combined Complexity and FPT in Ontology-Mediated Querying. Description Logics (2019)
Pablo Barceló, Miguel Romero, Thomas Zeume
A More General Theory of Static Approximations for Conjunctive Queries. CoRR (2019)
Pablo Barceló, Diego Figueira, Miguel Romero
Boundedness of Conjunctive Regular Path Queries. ICALP (2019)
Marcelo Arenas, Pablo Barceló, Mikaël Monet
Counting Problems over Incomplete Databases. CoRR (2019)
Pablo Barceló, Victor Dalmau, Cristina Feier, Carsten Lutz, Andreas Pieris
The Limits of Efficiency for Open- and Closed-World Query Evaluation Under Guarded TGDs. CoRR (2019)
Pablo Barceló, Chih-Duo Hong, Xuan Bach Le, Anthony W. Lin, Reino Niskanen
Monadic Decomposability of Regular Relations. ICALP (2019)
Jorge Pérez, Javier Marinkovic, Pablo Barceló
On the Turing Completeness of Modern Neural Network Architectures. CoRR (2019)
Jorge Pérez, Javier Marinkovic, Pablo Barceló
On the Turing Completeness of Modern Neural Network Architectures. ICLR (Poster) (2019)
Pablo Barceló, Chih-Duo Hong, Xuan Bach Le, Anthony W. Lin, Reino Niskanen
Monadic Decomposability of Regular Relations. CoRR (2019)
Pablo Barceló, Nelson Higuera, Jorge Pérez, Bernardo Subercaseaux
Expressiveness of Matrix and Tensor Query Languages in terms of ML Operators. DEEM@SIGMOD (2019)
Pablo Barceló, Alexander Baumgartner, Victor Dalmau, Benny Kimelfeld
Regularizing Conjunctive Features for Classification. PODS (2019)
Pablo Barceló, Diego Figueira, Miguel Romero
Boundedness of Conjunctive Regular Path Queries. CoRR (2019)
Pablo Barceló, Nelson Higuera, Jorge Pérez, Bernardo Subercaseaux
On the Expressiveness of LARA: A Unified Language for Linear and Relational Algebra. CoRR (2019)
Pablo Barceló
A Theoretical View on Reverse Engineering Problems for Database Query Languages. Description Logics (2019)
Pablo Barceló, Gerald Berger, Carsten Lutz, Andreas Pieris
First-Order Rewritability of Frontier-Guarded Ontology-Mediated Queries. AMW (2018)
Pablo Barceló, Markus Kröll, Reinhard Pichler, Sebastian Skritek
Efficient Evaluation and Static Analysis for Well-Designed Pattern Trees with Projection. ACM Trans. Database Syst. 43 (2) (2018)
Serge Abiteboul, Marcelo Arenas, Pablo Barceló, Meghyn Bienvenu, Diego Calvanese, Claire David, Richard Hull, Eyke Hüllermeier, Benny Kimelfeld, Leonid Libkin, Wim Martens, Tova Milo, Filip Murlak, Frank Neven, Magdalena Ortiz, Thomas Schwentick, Julia Stoyanovich, Jianwen Su, Dan Suciu, Victor Vianu, Ke Yi
Research Directions for Principles of Data Management (Dagstuhl Perspectives Workshop 16151). Dagstuhl Manifestos 7 (1) (2018)
Renzo Angles, Marcelo Arenas, Pablo Barceló, Peter A. Boncz, George H. L. Fletcher, Claudio Gutiérrez, Tobias Lindaaker, Marcus Paradies, Stefan Plantikow, Juan F. Sequeda, Oskar van Rest, Hannes Voigt
G-CORE: A Core for Future Graph Query Languages. SIGMOD Conference (2018)
Sergio Abriola, Pablo Barceló, Diego Figueira, Santiago Figueira
Bisimulations on Data Graphs. J. Artif. Intell. Res. 61 (2018)
Pablo Barceló, Miguel Romero, Thomas Zeume
A More General Theory of Static Approximations for Conjunctive Queries. ICDT (2018)
Pablo Barceló, Gerald Berger, Andreas Pieris
Containment for Rule-Based Ontology-Mediated Queries. PODS (2018)
Pablo Barceló, Gerald Berger, Carsten Lutz, Andreas Pieris
First-Order Rewritability of Frontier-Guarded Ontology-Mediated Queries. IJCAI (2018)
Pablo Barceló, Gerald Berger, Andreas Pieris
Guarded Ontology-Mediated Queries Distributing Over Components. AMW (2017)
Serge Abiteboul, Marcelo Arenas, Pablo Barceló, Meghyn Bienvenu, Diego Calvanese, Claire David, Richard Hull, Eyke Hüllermeier, Benny Kimelfeld, Leonid Libkin, Wim Martens, Tova Milo, Filip Murlak, Frank Neven, Magdalena Ortiz, Thomas Schwentick, Julia Stoyanovich, Jianwen Su, Dan Suciu, Victor Vianu, Ke Yi
Research Directions for Principles of Data Management (Dagstuhl Perspectives Workshop 16151). CoRR (2017)
Pablo Barceló, Miguel Romero
The Complexity of Reverse Engineering Problems for Conjunctive Queries. ICDT (2017)
Pablo Barceló, Pablo Muñoz
Graph Logics with Rational Relations: The Role of Word Combinatorics. ACM Trans. Comput. Log. 18 (2) (2017)
Renzo Angles, Marcelo Arenas, Pablo Barceló, Peter A. Boncz, George H. L. Fletcher, Claudio Gutiérrez, Tobias Lindaaker, Marcus Paradies, Stefan Plantikow, Juan F. Sequeda, Oskar van Rest, Hannes Voigt
G-CORE: A Core for Future Graph Query Languages. CoRR (2017)
Pablo Barceló, Gaëlle Fontaine
On the data complexity of consistent query answering over graph databases. J. Comput. Syst. Sci. 88 (2017)
Renzo Angles, Marcelo Arenas, Pablo Barceló, Aidan Hogan, Juan L. Reutter, Domagoj Vrgoc
Foundations of Modern Query Languages for Graph Databases. ACM Comput. Surv. 50 (5) (2017)
Ulrich Kohlenbach, Pablo Barceló, Ruy J. G. B. de Queiroz
21st Workshop on Logic, Language, Information and Computation - WoLLIC 2014. Inf. Comput. 255 (2017)
Pablo Barceló, Andreas Pieris, Miguel Romero
Semantic Optimization in Tractable Classes of Conjunctive Queries. SIGMOD Rec. 46 (2) (2017)
Miguel Romero, Pablo Barceló, Moshe Y. Vardi
The homomorphism problem for regular graph patterns. LICS (2017)
Pablo Barceló, Gerald Berger, Andreas Pieris
Containment for Rule-Based Ontology-Mediated Queries. CoRR (2017)
Pablo Barceló, Georg Gottlob, Andreas Pieris
Semantic Acyclicity Under Constraints. PODS (2016)
Sergio Abriola, Pablo Barceló, Diego Figueira, Santiago Figueira
Bisimulations on Data Graphs. KR (2016)
Pablo Barceló, Georg Gottlob, Andreas Pieris
Semantic Acyclicity Under Constraints. AMW (2016)
Renzo Angles, Marcelo Arenas, Pablo Barceló, Aidan Hogan, Juan L. Reutter, Domagoj Vrgoc
Foundations of Modern Graph Query Languages. CoRR (2016)
Serge Abiteboul, Marcelo Arenas, Pablo Barceló, Meghyn Bienvenu, Diego Calvanese, Claire David, Richard Hull, Eyke Hüllermeier, Benny Kimelfeld, Leonid Libkin, Wim Martens, Tova Milo, Filip Murlak, Frank Neven, Magdalena Ortiz, Thomas Schwentick, Julia Stoyanovich, Jianwen Su, Dan Suciu, Victor Vianu, Ke Yi
Research Directions for Principles of Data Management (Abridged). SIGMOD Rec. 45 (4) (2016)
Pablo Barceló, Georg Gottlob, Andreas Pieris
Semantic Acyclicity Under Constraints. CoRR (2016)
Pablo Barceló, Miguel Romero
The complexity of reverse engineering problems for conjunctive queries. CoRR (2016)
Pablo Barceló, Leonid Libkin
Order-Invariant Types and Their Applications. Log. Methods Comput. Sci. 12 (1) (2016)
Anthony Widjaja Lin, Pablo Barceló
String solving with word equations and transducers: towards a logic for analysing mutation XSS. POPL (2016)
Pablo Barceló
Semantic Acyclicity for Conjunctive Queries: Approximations and Constraints. WoLLIC (2016)
Pablo Barceló, Miguel Romero, Moshe Y. Vardi
Semantic Acyclicity on Graph Databases. SIAM J. Comput. 45 (4) (2016)
Pablo Barceló, Gaëlle Fontaine
On the Data Complexity of Consistent Query Answering over Graph Databases. ICDT (2015)
Pablo Barceló, Reinhard Pichler, Sebastian Skritek
Efficient Evaluation of Well-designed Pattern Trees (Extended Abstract). AMW (2015)
Pablo Barceló, Gaëlle Fontaine, Anthony Widjaja Lin
Expressive Path Queries on Graph with Data. Log. Methods Comput. Sci. 11 (4) (2015)
Anthony W. Lin, Pablo Barceló
String Solving with Word Equations and Transducers: Towards a Logic for Analysing Mutation XSS (Full Version). CoRR (2015)
Pablo Barceló, Reinhard Pichler, Sebastian Skritek
Efficient Evaluation and Approximation of Well-designed Pattern Trees. PODS (2015)
Ulrich Kohlenbach, Pablo Barceló, Ruy J. G. B. de Queiroz
). Log. J. IGPL 23 (5) (2015)
Pablo Barceló, Miguel Romero, Moshe Y. Vardi
Does query evaluation tractability help query containment? PODS (2014)
Pablo Barceló, Leonid Libkin, Juan L. Reutter
Querying Regular Graph Patterns. J. ACM 61 (1) (2014)

Pablo Barceló.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Pablo Barceló