All Stories

  1. Compressing CFI Graphs and Lower Bounds for the Weisfeiler-Leman Refinements
  2. The Iteration Number of the Weisfeiler-Leman Algorithm
  3. Are Targeted Messages More Effective?
  4. The ACM PODS Alberto O. Mendelzon Test-of-Time Award 2024
  5. Database Repairing with Soft Functional Dependencies
  6. Selecting Walk Schemes for Database Embedding
  7. Canonisation and Definability for Graphs of Bounded Rank Width
  8. Recursive database querying with continuous sampling
  9. Independence in Infinite Probabilistic Databases
  10. On the Parameterized Complexity of Learning First-Order Logic
  11. The Logic of Graph Neural Networks
  12. Tuple-Independent Representations of Infinite Probabilistic Databases
  13. Isomorphism, canonization, and definability for graphs of bounded rank width
  14. An Improved Isomorphism Test for Bounded-tree-width Graphs
  15. Generative Datalog with Continuous Distributions
  16. word2vec, node2vec, graph2vec, X2vec: Towards a Theory of Vector Embeddings of Structured Data
  17. Counting Bounded Tree Depth Homomorphisms
  18. Probabilistic Databases with an Infinite Open-World Assumption
  19. Deciding First-Order Properties of Nowhere Dense Graphs
  20. PEBBLE GAMES AND LINEAR EQUATIONS
  21. Computing with Tangles
  22. Constraint Solving via Fractional Edge Covers