All Stories

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