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

Authors

28

  1. AA
    Antoine Amarilli

    Télécom Paris, France

    2 publications · 27 citations

    2

    h-index

  2. FW
    Frank Wolter

    University of Liverpool, United Kingdom

    2 publications · 54 citations

    2

    h-index

  3. CL
    Carsten Lutz

    University of Bremen, Germany

    2 publications · 54 citations

    2

    h-index

  4. PS
    Pierre Senellart

    Télécom Paris, France

    2 publications · 27 citations

    2

    h-index

  5. PB
    Pierre Bourhis

    Institut national de recherche en sciences et technologies du numérique, France

    2 publications · 27 citations

    2

    h-index

1–5 of 28

Venues

  1. Journal of Symbolic Logic

    1 publications · 12 citations

    1

    h-index

  2. Artificial Intelligence

    1 publications · 21 citations

    1

    h-index

  3. View

    1 publications · 14 citations

    1

    h-index

  4. arXiv (Cornell University)

    Repository · 1 publications · 17 citations

    1

    h-index

  5. International Conference on Artificial Intelligence

    Conference · 1 publications · 40 citations

    1

    h-index

1–5