Symmetry and Similarity

Informazioni relative al progetto

SymSim

ID dell’accordo di sovvenzione: 101054974

DOI

10.3030/101054974

Data della firma CE 30 Maggio 2022

Data di avvio 1 Ottobre 2022

Data di completamento 30 Settembre 2027

Finanziato da

• European Research Council (ERC)

Costo totale

€ 2 495 575,00

Contributo UE

€ 2 495 575,00

Coordinato da

RHEINISCH-WESTFAELISCHE TECHNISCHE HOCHSCHULE AACHEN
Germany

CORDIS fornisce collegamenti ai risultati finali pubblici e alle pubblicazioni dei progetti ORIZZONTE.

I link ai risultati e alle pubblicazioni dei progetti del 7° PQ, così come i link ad alcuni tipi di risultati specifici come dataset e software, sono recuperati dinamicamente da .OpenAIRE .

Pubblicazioni

Conference proceedings (14)

Simulating Logspace-Recursion with Logarithmic Quantifier Depth

Autori: van Bergerem, Steffen; Grohe, Martin; Kiefer, Sandra; Oeljeklaus, Luca Frédéric Tilmann
Pubblicato in: 38th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS) : 26 – 29 June 2023, Boston, USA, 2023<br/>38. Annual ACM/IEEE Symposium on Logic in Computer Science, LICS, Boston, MA, USA, 2023-06-26 - 2023-06-29, 2023
Editore: IEEE
DOI: 10.48550/arxiv.2304.12948

Limitations of Game Comonads for Invertible-Map Equivalence via Homomorphism Indistinguishability

Autori: Lichter, Moritz; Pago, Benedikt Thomas; Seppelt, Tim Frederik
Pubblicato in: 32nd EACSL Annual Conference on Computer Science Logic : CSL 2024, February 19–23, 2024, Naples, Italy / edited by Aniello Murano, Alexandra Silva<br/>32. EACSL Annual Conference on Computer Science Logic, CSL 2024, Naples, Italy, 2024-02-19 - 2024-02-23, 2024
Editore: Schloss Dagstuhl – Leibniz-Zentrum für Informatik
DOI: 10.48550/arXiv.2308.05693

An Algorithmic Meta Theorem for Homomorphism Indistinguishability

Autori: Seppelt, Tim Frederik
Pubblicato in: 49th International Symposium on Mathematical Foundations of Computer Science, 2024
Editore: Schloss Dagstuhl – Leibniz-Zentrum für Informatik
DOI: 10.48550/arXiv.2402.08989

The Complexity of Homomorphism Reconstructibility

Autori: Böker, Jan Wilhelm; Härtel, Louis; Runde, Nina Katrin; Seppelt, Tim Frederik; Standke, Christoph
Pubblicato in: 41st International Symposium on Theoretical Aspects of Computer Science (STACS 2024), 2023
Editore: Schloss Dagstuhl - Leibniz-Zentrum für Informatik GmbH
DOI: 10.48550/arxiv.2310.09009

Position: Future Directions in the Theory of Graph Machine Learning

Autori: Christopher Morris, Fabrizio Frasca, Nadav Dym, Haggai Maron, Ismail Ilkan Ceylan, Ron Levie, Derek Lim, Michael M. Bronstein, Martin Grohe, Stefanie Jegelka
Pubblicato in: 41st International Conference on Machine Learning, 2024
Editore: MLR Press

The Descriptive Complexity of Graph Neural Networks

Autori: Grohe, Martin
Pubblicato in: Proceedings of the 38th Annual ACM/IEEE Symposium on Logic in Computer Science, 2023
Editore: IEEE
DOI: 10.48550/arxiv.2303.04613

Are Targeted Messages More Effective?

Autori: Martin Grohe, Eran Rosenbluth
Pubblicato in: Proceedings of the 39th Annual ACM/IEEE Symposium on Logic in Computer Science, 2024
Editore: ACM
DOI: 10.48550/arXiv.2403.06817

Fine-grained Expressivity of Graph Neural Networks

Autori: Böker, Jan; Levie, Ron; Huang, Ningyuan; Villar, Soledad; Morris, Christopher
Pubblicato in: Advances in Neural Information Processing Systems, 2023
Editore: MLR Press

Compressing CFI Graphs and Lower Bounds for the Weisfeiler-Leman Refinements

Autori: Grohe, Martin; Lichter, Moritz; Neuen, Daniel; Schweitzer, Pascal
Pubblicato in: 2023 IEEE 64th Annual Symposium on Foundations of Computer Science (FOCS), 2023
Editore: IEEE
DOI: 10.48550/arxiv.2308.11970

The Iteration Number of the Weisfeiler-Leman Algorithm

Autori: Martin Grohe, Moritz Lichter, Daniel Neuen
Pubblicato in: 2023 38th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS), 2024
Editore: IEEE
DOI: 10.48550/arXiv.2301.13317

Isomorphism for Tournaments of Small Twin Width

Autori: Martin Grohe and Daniel Neuen
Pubblicato in: Proceedings of the 51st International Colloquium on Automata, Languages, and Programming, 2024
Editore: Schloss Dagstuhl - Leibniz-Zentrum für Informatik
DOI: 10.48550/arXiv.2312.02048

Some Thoughts on Graph Similarity

Autori: Martin Grohe
Pubblicato in: Principles of Verification: Cycling the Probabilistic Landscape: Essays Dedicated to Joost-Pieter Katoen on the Occasion of His 60th Birthday, Part I, 2024
Editore: Springer
DOI: 10.48550/ARXIV.2411.10182

WL meet VC

Autori: Morris, Christopher; Geerts, Floris; Tönshoff, Jan; Grohe, Martin
Pubblicato in: Proceedings of the 40th International Conference on Machine Learning (PMLR), 2023, Honolulu, Hawaii, USA., 2023
Editore: MLR Press

Going Deep and Going Wide: Counting Logic and Homomorphism Indistinguishability over Graphs of Bounded Treedepth and Treewidth

Autori: Fluck, Eva; Seppelt, Tim Frederik; Spitzer, Gian Luca
Pubblicato in: 32nd EACSL Annual Conference on Computer Science Logic : CSL 2024, February 19–23, 2024, Naples, Italy / edited by Aniello Murano, Alexandra Silvapages, 2023
Editore: Schloss Dagstuhl – Leibniz-Zentrum für Informatik
DOI: 10.48550/arxiv.2308.06044

Peer reviewed articles (4)

Where Did the Gap Go? Reassessing the Long-Range Graph Benchmark

Autori: Jan Tönshoff, Martin Ritzert, Eran Rosenbluth, Martin Grohe
Pubblicato in: Transactions on Machine Learning Research, 2024, ISSN 2835-8856
Editore: MLR Press
DOI: 10.48550/ARXIV.2309.00367

Logical equivalences, homomorphism indistinguishability, and forbidden minors

Autori: Tim Seppelt
Pubblicato in: Information and Computation, Numero 301, 2024, ISSN 0890-5401
Editore: Elsevier BV
DOI: 10.48550/arXiv.2302.11290

Weisfeiler-Leman Indistinguishability of Graphons

Autori: Jan Böker
Pubblicato in: The Electronic Journal of Combinatorics, Numero 30, 2023, ISSN 1077-8926
Editore: The Electronic Journal of Combinatorics
DOI: 10.37236/10973

Lasserre Hierarchy for Graph Isomorphism and Homomorphism Indistinguishability

Autori: David E. Roberson, Tim Seppelt
Pubblicato in: TheoretiCS, Numero Volume 3, 2024, ISSN 2751-4838
Editore: Centre pour la Communication Scientifique Directe (CCSD)
DOI: 10.46298/theoretics.24.20

Other (5)

The Parameterized Complexity of Learning Monadic Second-Order Logic

Autori: van Bergerem, Steffen; Grohe, Martin; Runde, Nina
Pubblicato in: 2023
Editore: arxiv.org
DOI: 10.48550/arxiv.2309.10489

Computational complexity of the Weisfeiler-Leman dimension

Autori: Lichter, Moritz; Raßmann, Simon; Schweitzer, Pascal
Pubblicato in: 2024
Editore: arxiv.org
DOI: 10.48550/arxiv.2402.11531

Structural Node Embeddings with Homomorphism Counts

Autori: Wolf, Hinrikus; Oeljeklaus, Luca Frédéric Tilmann; Kühner, Pascal; Grohe, Martin
Pubblicato in: 2023
Editore: arxiv.org
DOI: 10.48550/arxiv.2308.15283

Supercritical Size-Width Tree-Like Resolution Trade-Offs for Graph Isomorphism

Autori: Christoph Berkholz and Moritz Lichter and Harry Vinall-Smeeth
Pubblicato in: 2024
Editore: arxiv.org
DOI: 10.48550/ARXIV.2407.17947

Limitations of Affine Integer Relaxations for Solving Constraint Satisfaction Problems

Autori: Moritz Lichter and Benedikt Pago
Pubblicato in: 2024
Editore: arxiv.org
DOI: 10.48550/ARXIV.2407.09097