First-Order Query Evaluation with Cardinality Conditions

07/19/2017
by   Martin Grohe, et al.
0

We study an extension of first-order logic that allows to express cardinality conditions in a similar way as SQL's COUNT operator. The corresponding logic FOC(P) was introduced by Kuske and Schweikardt (LICS'17), who showed that query evaluation for this logic is fixed-parameter tractable on classes of structures (or databases) of bounded degree. In the present paper, we first show that the fixed-parameter tractability of FOC(P) cannot even be generalised to very simple classes of structures of unbounded degree such as unranked trees or strings with a linear order relation. Then we identify a fragment FOC1(P) of FOC(P) which is still sufficiently strong to express standard applications of SQL's COUNT operator. Our main result shows that query evaluation for FOC1(P) is fixed-parameter tractable with almost linear running time on nowhere dense classes of structures. As a corollary, we also obtain a fixed-parameter tractable algorithm for counting the number of tuples satisfying a query over nowhere dense classes of structures.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
02/19/2016

Strong Backdoors for Default Logic

In this paper, we introduce a notion of backdoors to Reiter's propositio...
research
10/06/2020

Dynamic Query Evaluation Over Structures with Low Degree

We consider the evaluation of first-order queries over classes of databa...
research
07/04/2023

Evaluating Restricted First-Order Counting Properties on Nowhere Dense Classes and Beyond

It is known that first-order logic with some counting extensions can be ...
research
09/15/2019

Nowhere dense graph classes and algorithmic applications. A tutorial at Highlights of Logic, Games and Automata 2019

The notion of nowhere dense graph classes was introduced by Nešetřil and...
research
04/21/2021

On the Width of Regular Classes of Finite Structures

In this work, we introduce the notion of decisional width of a finite re...
research
01/31/2023

A monotone connection between model class size and description length

This paper links sizes of model classes to the minimum lengths of their ...

Please sign up or login with your details

Forgot password? Click here to reset