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.

[1]  Ronald Fagin.  Generalized first-order spectra, and polynomial. time recognizable sets , 1974 .

[2]  Yann Strozecki,et al.  Enumeration complexity and matroid decomposition , 2010 .

[3]  Erich Grädel,et al.  Model-checking games for logics of imperfect information , 2013, Theor. Comput. Sci..

[4]  Mihalis Yannakakis,et al.  On Generating All Maximal Independent Sets , 1988, Inf. Process. Lett..

[5]  Jouko A. Väänänen,et al.  Dependence Logic - A New Approach to Independence Friendly Logic , 2007, London Mathematical Society student texts.

[6]  Fan Yang,et al.  Counting of Teams in First-Order Team Logics , 2019, MFCS.

[7]  Lauri Hella,et al.  Inclusion Logic and Fixed Point Logic , 2013, CSL.

[8]  Heribert Vollmer,et al.  Parameterized Complexity of Weighted Satisfiability Problems: Decision, Enumeration, Counting , 2015, Fundam. Informaticae.

[9]  Heribert Vollmer,et al.  A complexity theory for hard enumeration problems , 2019, Discret. Appl. Math..

[10]  Jonni Virtema,et al.  Complexity of Propositional Logics in Team Semantic , 2018, TOCL.

[11]  Phokion G. Kolaitis,et al.  The complexity of mining maximal frequent subgraphs , 2013, PODS '13.

[12]  Juha Kontinen,et al.  On Definability in Dependence Logic , 2009, J. Log. Lang. Inf..

[13]  Erich Grädel,et al.  Dependence and Independence , 2012, Stud Logica.

[14]  Claudio L. Lucchesi,et al.  Candidate Keys for Relations , 1978, J. Comput. Syst. Sci..

[15]  Arne Meier,et al.  Enumeration Complexity of Poor Man's Propositional Dependence Logic , 2018, FoIKS.

[16]  Pietro Galliani,et al.  Inclusion and exclusion dependencies in team semantics - On some logics of imperfect information , 2011, Ann. Pure Appl. Log..

[17]  Nicole Schweikardt,et al.  Enumerating answers to first-order queries over databases of low degree , 2014, PODS.

[18]  Arnaud Durand,et al.  On Acyclic Conjunctive Queries and Constant Delay Enumeration , 2007, CSL.

[19]  Benny Kimelfeld,et al.  Efficiently Enumerating Minimal Triangulations , 2016, PODS.

[20]  Nicholas Pippenger,et al.  Theories of computability , 1997 .