1 code implementation • 18 Oct 2023 • Marcelo Arenas, Pablo Barcelo, Diego Bustamante, Jose Caraball, Bernardo Subercaseaux
The formal XAI community has studied a plethora of interpretability queries aiming to understand the classifications made by decision trees.
no code implementations • 5 Oct 2023 • Pablo Barcelo, Alexander Kozachinskiy, Anthony Widjaja Lin, Vladimir Podolskii
We contribute to the study of formal languages that can be recognized by transformer encoders.
1 code implementation • 30 Nov 2022 • Pablo Barcelo, Mikhail Galkin, Christopher Morris, Miguel Romero Orth
Namely, we investigate the limitations in the expressive power of the well-known Relational GCN and Compositional GCN architectures and shed some light on their practical learning performance.
no code implementations • 18 Nov 2020 • Pablo Barcelo, Gerald Berger, Carsten Lutz, Andreas Pieris
In both approaches, we provide semantic characterizations of FO-rewritability that are of independent interest.
no code implementations • 17 Mar 2020 • Pablo Barcelo, Cristina Feier, Carsten Lutz, Andreas Pieris
We further study the complexity of the meta problem of deciding whether a given OMQ is equivalent to an OMQ of bounded tree width, providing several completeness results that range from NP to 2ExpTime, depending on the DL used.
no code implementations • 28 Dec 2019 • Pablo Barcelo, Victor Dalmau, Cristina Feier, Carsten Lutz, Andreas Pieris
For querying in the presence of constraints, we consider classes of constraint-query specifications (CQSs) that bundle a set of constraints with an actual query.
no code implementations • 23 Mar 2017 • Pablo Barcelo, Gerald Berger, Andreas Pieris
We also apply our techniques to pinpoint the complexity of problems associated with two emerging applications of OMQ containment: distribution over components and UCQ rewritability of OMQs.
no code implementations • 5 Nov 2015 • Anthony W. Lin, Pablo Barcelo
On the one hand, word equations (string logic with concatenations) cannot precisely capture sanitisation functions (e. g. htmlescape) and implicit browser transductions (e. g. innerHTML mutations).
Logic in Computer Science F.3.1