Now showing items 1-2 of 2

    • Barceló, Pablo; Romero, Miguel; Zeume, Thomas (Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, 2018)
      Conjunctive query (CQ) evaluation is NP-complete, but becomes tractable for fragments of bounded hypertreewidth. Approximating a hard CQ by a query from such a fragment can thus allow for an efficient approximate evaluation. ...
    • Barceló, Pablo; Kostylev, Egor; Monet, Mikael; Pérez Rojas, Jorge; Reutter, Juan L.; Silva, Juan Pablo (Assoc. Computing Machinery, 2020)
      In this paper we survey our recent results characterizing various graph neural network (GNN) architectures in terms of their ability to classify nodes over graphs, for classifiers based on unary logical formulas- or queries. ...