Fo-definable Queries
FO-Definable Queries is a class of logical queries in descriptive complexity theory that are expressible in first-order logic, distinguished by their characterization of computational problems definable by formulas over finite structures without the use of higher-order quantification.
12
Publications
245
Citations
28
Authors
19
Institutions
Publications per year
2017–2026
3
Parents
12
Anuj Dawar, Martin Grohe, Bjarki Holm et al. · 2009 · 42 citations
Enumeration for FO Queries over Nowhere Dense Graphs
Nicole Schweikardt, Luc Segoufin, Alexandre Vigny · 2018 · 24 citations
Definability problems for graph query languages
Timos Antonopoulos, Frank Neven, Frédéric Servais · 2013 · 18 citations
1–5 of 12
28
2
h-index
2
h-index
2
h-index
2
h-index
Institut national de recherche en sciences et technologies du numérique, France
2 publications · 27 citations
2
h-index
1–5 of 28
19

University of Liverpool
Liverpool, United Kingdom
2 h-index
4 publications
82 citations
University of Bremen
Bremen, Germany
2 h-index
2 publications
54 citations
Humboldt-Universität zu Berlin
Berlin, Germany
2 h-index
3 publications
108 citations
University of Bayreuth
Bayreuth, Germany
2 h-index
3 publications
45 citations

Télécom Paris
Palaiseau, France
1 h-index
2 publications
20 citations

Centre National de la Recherche Scientifique
Paris, France
1 h-index
3 publications
30 citations
Institut national de recherche en sciences et technologies du numérique
Le Chesnay-Rocquencourt, France
1 h-index
1 publications
24 citations
Délégation Paris 7
Bagnolet, France
1 h-index
1 publications
24 citations
1–8 of 19
1 publications · 12 citations
1
h-index
1 publications · 21 citations
1
h-index
1 publications · 14 citations
1
h-index
Repository · 1 publications · 17 citations
1
h-index
Conference · 1 publications · 40 citations
1
h-index
1–5