Search Results for author:
Found 8 papers, 2 papers with code
A Symbolic Language for Interpreting Decision Trees
The recent development of formal explainable AI has disputed the folklore claim that "decision trees are readily interpretable models", showing different interpretability queries that are computationally hard on decision trees, as well as proposing different methods to deal with them in practice.
Logical Languages Accepted by Transformer Encoders with Hard Attention
We contribute to the study of formal languages that can be recognized by transformer encoders.
Weisfeiler and Leman Go Relational
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.
First-Order Rewritability of Frontier-Guarded Ontology-Mediated Queries
In both approaches, we provide semantic characterizations of FO-rewritability that are of independent interest.
When is Ontology-Mediated Querying Efficient?
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.
The Limits of Efficiency for Open- and Closed-World Query Evaluation Under Guarded TGDs
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.
Containment for Rule-Based Ontology-Mediated Queries
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.
String Solving with Word Equations and Transducers: Towards a Logic for Analysing Mutation XSS (Full Version)
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
