On the expressiveness of Lara: A proposal for unifying linear and relational algebra | 0 | 0.34 | 2022 |
PODS '22: International Conference on Management of Data, Philadelphia, PA, USA, June 12 - 17, 2022 | 0 | 0.34 | 2022 |
The Tractability of SHAP-Score-Based Explanations for Classification over Deterministic and Decomposable Boolean Circuits | 0 | 0.34 | 2021 |
Attention is Turing-Complete. | 0 | 0.34 | 2021 |
Explainability Queries for ML Models and its Connections with Data Management Problems (Invited Talk). | 0 | 0.34 | 2021 |
Special Issue on Database Theory | 0 | 0.34 | 2021 |
Regularizing conjunctive features for classification | 0 | 0.34 | 2021 |
The Complexity of Counting Problems Over Incomplete Databases | 0 | 0.34 | 2021 |
Foundations of Symbolic Languages for Model Interpretability. | 0 | 0.34 | 2021 |
Graph Neural Networks with Local Graph Parameters. | 0 | 0.34 | 2021 |
The Limits of Efficiency for Open- and Closed-World Query Evaluation Under Guarded TGDs | 0 | 0.34 | 2020 |
Chile's new interdisciplinary institute for foundational research on data | 0 | 0.34 | 2020 |
The Expressive Power of Graph Neural Networks as a Query Language | 1 | 0.35 | 2020 |
Model Interpretability through the lens of Computational Complexity | 0 | 0.34 | 2020 |
Counting Problems over Incomplete Databases | 0 | 0.34 | 2020 |
Semantic Optimization of Conjunctive Queries | 0 | 0.34 | 2020 |
The Logical Expressiveness of Graph Neural Networks | 1 | 0.34 | 2020 |
The Logical Expressiveness of Graph Neural Networks. | 0 | 0.34 | 2020 |
On the Expressiveness of LARA - A Unified Language for Linear and Relational Algebra. | 0 | 0.34 | 2020 |
On the Turing Completeness of Modern Neural Network Architectures. | 0 | 0.34 | 2019 |
22nd International Conference on Database Theory, ICDT 2019, March 26-28, 2019, Lisbon, Portugal. | 0 | 0.34 | 2019 |
PTime Combined Complexity and FPT in Ontology-Mediated Querying. | 0 | 0.34 | 2019 |
Expressiveness of Matrix and Tensor Query Languages in terms of ML Operators | 0 | 0.34 | 2019 |
Regularizing Conjunctive Features for Classification | 0 | 0.34 | 2019 |
On the Turing Completeness of Modern Neural Network Architectures. | 1 | 0.36 | 2019 |
Boundedness of Conjunctive Regular Path Queries. | 0 | 0.34 | 2019 |
A Theoretical View on Reverse Engineering Problems for Database Query Languages. | 0 | 0.34 | 2019 |
Monadic Decomposability of Regular Relations. | 0 | 0.34 | 2019 |
First-Order Rewritability of Frontier-Guarded Ontology-Mediated Queries. | 0 | 0.34 | 2018 |
A More General Theory of Static Approximations for Conjunctive Queries | 0 | 0.34 | 2018 |
G-CORE: A Core for Future Graph Query Languages. | 13 | 0.63 | 2018 |
Containment for Rule-Based Ontology-Mediated Queries. | 1 | 0.36 | 2018 |
Research Directions for Principles of Data Management (Dagstuhl Perspectives Workshop 16151). | 5 | 0.41 | 2018 |
Efficient Evaluation and Static Analysis for Well-Designed Pattern Trees with Projection. | 0 | 0.34 | 2018 |
First-Order Rewritability of Frontier-Guarded Ontology-Mediated Queries. | 0 | 0.34 | 2018 |
Bisimulations on Data Graphs. | 1 | 0.36 | 2018 |
Semantic Optimization in Tractable Classes of Conjunctive Queries. | 2 | 0.35 | 2017 |
Guarded Ontology-Mediated Queries Distributing Over Components. | 0 | 0.34 | 2017 |
21st Workshop on Logic, Language, Information and Computation (WoLLIC 2014) | 0 | 0.34 | 2017 |
Foundations of Modern Query Languages for Graph Databases. | 31 | 0.93 | 2017 |
The complexity of reverse engineering problems for conjunctive queries. | 4 | 0.42 | 2017 |
String solving with word equations and transducers: towards a logic for analysing mutation XSS. | 9 | 0.48 | 2016 |
Semantic Acyclicity for Conjunctive Queries: Approximations and Constraints. | 0 | 0.34 | 2016 |
Semantic Acyclicity Under Constraints. | 7 | 0.47 | 2016 |
Foundations of Modern Graph Query Languages. | 11 | 0.58 | 2016 |
Order-Invariant Types and Their Applications | 0 | 0.34 | 2016 |
Order-Invariant Types and Their Applications. | 0 | 0.34 | 2016 |
Research Directions for Principles of Data Management (Abridged). | 5 | 0.43 | 2016 |
Efficient Evaluation and Approximation of Well-designed Pattern Trees | 13 | 0.59 | 2015 |
String Solving with Word Equations and Transducers: Towards a Logic for Analysing Mutation XSS (Full Version) | 1 | 0.35 | 2015 |