Query Languages for Machine-Learning Models

Fuente: arXiv
Saved in:
Bibliographic Details
Main Author: Grohe, Martin
Format: Preprint
Published: 2026
Subjects:
Online Access:
Tags: Add Tag
No Tags, Be the first to tag this record!
_version_ 1866918288906256384
author Grohe, Martin
author_facet Grohe, Martin
contents In this paper, I discuss two logics for weighted finite structures: first-order logic with summation (FO(SUM)) and its recursive extension IFP(SUM). These logics originate from foundational work by Grädel, Gurevich, and Meer in the 1990s. In recent joint work with Standke, Steegmans, and Van den Bussche, we have investigated these logics as query languages for machine learning models, specifically neural networks, which are naturally represented as weighted graphs. I present illustrative examples of queries to neural networks that can be expressed in these logics and discuss fundamental results on their expressiveness and computational complexity.
format Preprint
id arxiv_https___arxiv_org_abs_2601_09381
institution arXiv
publishDate 2026
record_format arxiv
spellingShingle Query Languages for Machine-Learning Models
Grohe, Martin
Logic in Computer Science
Artificial Intelligence
Databases
In this paper, I discuss two logics for weighted finite structures: first-order logic with summation (FO(SUM)) and its recursive extension IFP(SUM). These logics originate from foundational work by Grädel, Gurevich, and Meer in the 1990s. In recent joint work with Standke, Steegmans, and Van den Bussche, we have investigated these logics as query languages for machine learning models, specifically neural networks, which are naturally represented as weighted graphs. I present illustrative examples of queries to neural networks that can be expressed in these logics and discuss fundamental results on their expressiveness and computational complexity.
title Query Languages for Machine-Learning Models
topic Logic in Computer Science
Artificial Intelligence
Databases
url https://arxiv.org/abs/2601.09381