Preservation and decomposition theorems for bounded degree structures

We provide elementary algorithms for two preservation theorems for first-order sentences with modulo m counting quantifiers (FO+MODm) on the class Cd of all finite structures of degree at most d: For each FO+MODm-sentence that is preserved under extensions (homomorphisms) on Cd, a Cd-equivalent existential (existential-positive) FO-sentence can be constructed in 6-fold (4-fold) exponential time. For FO-sentences, the algorithm has 5-fold (4-fold) exponential time complexity. This is complemented by lower bounds showing that for FO-sentences a 3-fold exponential blow-up of the computed existential (existential-positive) sentence is unavoidable. Furthermore, we show that for an input FO-formula, a Cd-equivalent Feferman-Vaught decomposition can be computed in 3-fold exponential time. We also provide a matching lower bound.

[1]  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.

[2]  Chen C. Chang,et al.  Model Theory: Third Edition (Dover Books On Mathematics) By C.C. Chang;H. Jerome Keisler;Mathematics , 1966 .

[3]  Jörg Flum,et al.  Parameterized Complexity Theory , 2006, Texts in Theoretical Computer Science. An EATCS Series.

[4]  Martin Grohe,et al.  Algorithmic Meta Theorems , 2008, WG.

[5]  Leonid Libkin,et al.  Elements of Finite Model Theory , 2004, Texts in Theoretical Computer Science.

[6]  Yuri Gurevich,et al.  Datalog vs First-Order Logic , 1994, J. Comput. Syst. Sci..

[7]  Benjamin Rossman,et al.  Homomorphism preservation theorems , 2008, JACM.

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

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

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

[11]  Anuj Dawar,et al.  Homomorphism Preservation on Quasi-Wide Classes , 2008, J. Comput. Syst. Sci..

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

[13]  Ashok K. Chandra,et al.  Optimal implementation of conjunctive queries in relational data bases , 1977, STOC '77.

[14]  Y. Gurevich.  On Finite Model Theory , 1990 .

[15]  Anuj Dawar,et al.  Preservation Under Extensions on Well-Behaved Finite Structures , 2005, ICALP.

[16]  Phokion G. Kolaitis,et al.  On preservation under homomorphisms and unions of conjunctive queries , 2004, PODS '04.

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

[18]  Martin Grohe,et al.  The complexity of first-order and monadic second-order logic revisited , 2002, Proceedings 17th Annual IEEE Symposium on Logic in Computer Science.

[19]  Xin-She Yang,et al.  Introduction to Algorithms , 2021, Nature-Inspired Optimization Algorithms.

[20]  H. Gaifman.  On Local and Non-Local Properties , 1982 .

[21]  Yuri Gurevich,et al.  Datalog vs. first-order logic , 1989, 30th Annual Symposium on Foundations of Computer Science.

[22]  Jean Christoph Jung,et al.  The Complexity of Decomposing Modal and First-Order Theories , 2012, 2012 27th Annual IEEE Symposium on Logic in Computer Science.

[23]  Jaroslav Nesetril,et al.  Graphs and homomorphisms , 2004, Oxford lecture series in mathematics and its applications.