Pablo Barceló
16 papers · 2018–2025 · 6 venues · across top CS/AI venues
Authors are matched by name, so researchers who share a name ("Yang Liu", "Wei Wang") appear as a single profile and their paper counts, venues and achievements are combined. How identity is handled.
Achievements
Jump to papers ↓+7 more ↓ Show less ↑
🗺️ Taxonomy Completionist (21) 🌍 Conference Polyglot · Silver 🏃 Academic Marathon · Sprint 🌉 Interdisciplinary Bridge · Silver 🐣 Hot Topic Early Bird
🏆
Grand Slam
🏆
Keyword Champion
(2)
📈
Trend Setter
❓
The Questioner
💎
Century Club · Bronze
🔥
Unstoppable · Bronze
🗃️
Keyword Collector
(70)
Top co-authors
Research topics
Machine Learning
(14)
Optimization & Theory
(11)
Artificial Intelligence
(9)
Core AI
(9)
Deep Learning
(8)
Architectures
(8)
Core Methods
(7)
Computer Science
(3)
Mathematics & Optimization
(3)
Foundations
(3)
Knowledge & Reasoning
(2)
Mathematics
(2)
Optimization
(1)
Reasoning
(1)
Representation
(1)
Keywords
graph neural network
(4)
model interpretability
(3)
decision tree
(3)
graph isomorphism
(2)
turing completeness
(2)
weisfeiler-leman test
(2)
shapley value
(2)
recurrent neural network
(2)
hard attention
(2)
first-order logic
(2)
computational complexity
(2)
weisfeiler-lehman test
(2)
boolean circuit
(2)
knowledge graph
(1)
expressive power
(1)
feature attribution
(1)
knowledge compilation
(1)
algorithm analysis
(1)
transformer
(1)
link prediction
(1)
Papers
Ehrenfeucht-Haussler Rank and Chain of Thought
ICML 2025
How Expressive are Knowledge Graph Foundation Models?
ICML 2025
Logical Languages Accepted by Transformer Encoders with Hard Attention
ICLR 2024
On the Power of the Weisfeiler-Leman Test for Graph Motif Parameters
ICLR 2024
A Theory of Link Prediction via Relational Weisfeiler-Leman on Knowledge Graphs
NeurIPS 2023
On the Complexity of SHAP-Score-Based Explanations: Tractability via Knowledge Compilation and Non-Approximability Results
JMLR 2023
Three Iterations of (d − 1)-WL Test Distinguish Non Isometric Clouds of d-dimensional Points
NeurIPS 2023
On Computing Probabilistic Explanations for Decision Trees
NeurIPS 2022
Attention is Turing-Complete
JMLR 2021
Foundations of Symbolic Languages for Model Interpretability
NeurIPS 2021
Graph Neural Networks with Local Graph Parameters
NeurIPS 2021
The Tractability of SHAP-Score-Based Explanations for Classification over Deterministic and Decomposable Boolean Circuits
AAAI 2021
Model Interpretability through the lens of Computational Complexity
NeurIPS 2020
The Logical Expressiveness of Graph Neural Networks
ICLR 2020
On the Turing Completeness of Modern Neural Network Architectures
ICLR 2019
First-Order Rewritability of Frontier-Guarded Ontology-Mediated Queries
IJCAI 2018