Zobrazeno 1 - 2
of 2
pro vyhledávání: '"Oeljeklaus, Luca"'
Graph homomorphism counts, first explored by Lov\'asz in 1967, have recently garnered interest as a powerful tool in graph-based machine learning. Grohe (PODS 2020) proposed the theoretical foundations for using homomorphism counts in machine learnin
Externí odkaz:
http://arxiv.org/abs/2308.15283
The fixed-point logic LREC= was developed by Grohe et al. (CSL 2011) in the quest for a logic to capture all problems decidable in logarithmic space. It extends FO+C, first-order logic with counting, by an operator that formalises a limited form of r
Externí odkaz:
http://arxiv.org/abs/2304.12948