Gaifman Normal Forms for Counting Extensions of First-Order Logic

We consider the extension of first-order logic FO by unary counting quantifiers and generalise the notion of Gaifman normal form from FO to this setting. For formulas that use only ultimately periodic counting quantifiers, we provide an algorithm that computes equivalent formulas in Gaifman normal form. We also show that this is not possible for formulas using at least one quantifier that is not ultimately periodic. Now let d be a degree bound. We show that for any formula phi with arbitrary counting quantifiers, there is a formula gamma in Gaifman normal form that is equivalent to phi on all finite structures of degree <= d. If the quantifiers of phi are decidable (decidable in elementary time, ultimately periodic), gamma can be constructed effectively (in elementary time, in worst-case optimal 3-fold exponential time). For the setting with unrestricted degree we show that by using our Gaifman normal form for formulas with only ultimately periodic counting quantifiers, a known fixed-parameter tractability result for FO on classes of structures of bounded local tree-width can be lifted to the extension of FO with ultimately periodic counting quantifiers (a logic equally expressive as FO+MOD, i.e., first-oder logic with modulo-counting quantifiers).

[1]  Benedikt Bollig,et al.  An optimal construction of Hanf sentences , 2011, J. Appl. Log..

[2]  Detlef Seese,et al.  Linear time computable problems and first-order descriptions , 1996, Mathematical Structures in Computer Science.

[3]  Frederik Harwath,et al.  On the locality of arb-invariant first-order formulas with modulo counting quantifiers , 2016, Log. Methods Comput. Sci..

[4]  Nicole Schweikardt,et al.  Hanf normal form for first-order logic with unary counting quantifiers , 2016, 2016 31st Annual ACM/IEEE Symposium on Logic in Computer Science (LICS).

[5]  Frederik Harwath,et al.  Preservation and decomposition theorems for bounded degree structures , 2014, Log. Methods Comput. Sci..

[6]  Lauri Hella,et al.  Notions of Locality and Their Logical Characterizations over Finite Models , 1999, J. Symb. Log..

[7]  John Doner,et al.  Tree Acceptors and Some of Their Applications , 1970, J. Comput. Syst. Sci..

[8]  A. Dawar.  FINITE MODEL THEORY (Perspectives in Mathematical Logic) , 1997 .

[9]  Nicole Schweikardt,et al.  An Optimal Gaifman Normal Form Construction for Structures of Bounded Degree , 2013, 2013 28th Annual ACM/IEEE Symposium on Logic in Computer Science.

[10]  Martin Grohe,et al.  Logic, graphs, and algorithms , 2007, Logic and Automata.

[11]  James W. Thatcher,et al.  Generalized finite automata theory with an application to a decision problem of second-order logic , 1968, Mathematical systems theory.

[12]  Detlef Seese,et al.  Easy Problems for Tree-Decomposable Graphs , 1991, J. Algorithms.

[13]  Armando B. Matos.  Periodic Sets of Integers , 1994, Theor. Comput. Sci..

[14]  Howard Straubing.  Finite Automata, Formal Logic, and Circuit Complexity , 1994, Progress in Theoretical Computer Science.

[15]  Bruno Courcelle,et al.  The Monadic Second-Order Logic of Graphs. I. Recognizable Sets of Finite Graphs , 1990, Inf. Comput..

[16]  Juha Nurmonen,et al.  Counting Modulo Quantifiers on Finite Structures , 2000, Inf. Comput..

[17]  Martin Grohe,et al.  Deciding first-order properties of locally tree-decomposable structures , 2000, JACM.

[18]  Stephan Kreutzer,et al.  Deciding first-order properties of nowhere dense graphs , 2013, STOC.

[19]  Hannu Niemistö.  Locality and order-invariant logics , 2007 .

[20]  Leonid Libkin,et al.  Elements Of Finite Model Theory (Texts in Theoretical Computer Science. An Eatcs Series) , 2004 .

[21]  Johann A. Makowsky,et al.  Algorithmic uses of the Feferman-Vaught Theorem , 2004, Ann. Pure Appl. Log..

[22]  Stephan Kreutzer,et al.  Model Theory Makes Formulas Large , 2007, ICALP.

[23]  Nicole Schweikardt,et al.  First-order logic with counting , 2017, 2017 32nd Annual ACM/IEEE Symposium on Logic in Computer Science (LICS).

[24]  S. Feferman,et al.  The first order properties of products of algebraic systems , 1959 .

[25]  Lucas Heimberg.  Complexity of Normal Forms on Structures of Bounded Degree , 2018 .

[26]  Robin Thomas,et al.  Deciding First-Order Properties for Sparse Graphs , 2010, 2010 IEEE 51st Annual Symposium on Foundations of Computer Science.