All Stories

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