Instruct: Identify the main and secondary category of Arxiv papers based on the titles and abstracts
Query: Enumerating Teams in First-Order Team Logics   We start the study of the enumeration complexity of different satisfiability
problems in first-order team logics. Since many of our problems go beyond DelP,
we use a framework for hard enumeration analogous to the polynomial hierarchy,
which was recently introduced by Creignou et al. (Discret. Appl. Math. 2019).
We show that the problem to enumerate all satisfying teams of a fixed formula
in a given first-order structure is DelNP-complete for certain formulas of
dependence logic and independence logic. For inclusion logic formulas, this
problem is even in DelP. Furthermore, we study the variants of this problems
where only maximal, minimal, maximum and minimum solutions, respectively, are
considered. For the most part these share the same complexity as the original
problem. An exception is the minimum-variant for inclusion logic, which is
DelNP-complete.

5
The categories of this paper are: gr-qc
17
The categories of this paper are: q-fin
28
The categories of this paper are: alg-geom
30
The categories of this paper are: q-alg
6
The categories of this paper are: astro-ph
21
The categories of this paper are: adap-org
18
The categories of this paper are: econ
27
The categories of this paper are: comp-gas
10
The categories of this paper are: q-bio
3
The categories of this paper are: physics
4
The categories of this paper are: cond-mat
12
The categories of this paper are: nucl-th
13
The categories of this paper are: quant-ph
15
The categories of this paper are: nucl-ex
37
The categories of this paper are: supr-con
26
The categories of this paper are: bayes-an