Towards a characterization of order-invariant queries over tame graphs

This work deals with the expressive power of logics on finite graphs with access to an additional “arbitrary” linear order. The queries that can be expressed this way are the order-invariant queries for the logic. For the standard logics used in computer science, such as first-order logic, it is known that access to an arbitrary linear order increases the expressiveness of the logic. However, when we look at the separating examples, we find that they have satisfying models whose Gaifman Graph is complex – unbounded in valence and in treewidth. We thus explore the expressiveness of order-invariant queries over well-behaved graphs. We prove that first-order order-invariant queries over strings and trees have no additional expressiveness over first-order logic in the original signature. We also prove new upper bounds on order-invariant queries over bounded treewidth and bounded valence graphs. Our results make use of a new technique of independent interest: the application of algebraic characterizations of definability to show collapse results. §

[1]  Dominique Perrin,et al.  Finite Automata , 1958, Philosophy.

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

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

[4]  Saharon Shelah,et al.  On the Strength of the Interpretation Method , 1989, J. Symb. Log..

[5]  Benjamin Rossman.  Successor-invariance in the finite , 2003, 18th Annual IEEE Symposium of Logic in Computer Science, 2003. Proceedings..

[6]  Thomas Schwentick,et al.  Locality of order-invariant first-order formulas , 1998, TOCL.

[7]  Martin Otto,et al.  Epsilon-logic is more expressive than first-order logic over finite structures , 2000, Journal of Symbolic Logic.

[8]  Michael Benedikt,et al.  Regular tree languages definable in FO and in FOmod , 2009, TOCL.

[9]  Bruno Courcelle,et al.  The Monadic Second-Order Logic of Graphs X: Linear Orderings , 1996, Theor. Comput. Sci..

[10]  Bruno Courcelle,et al.  The Monadic Second-Order Logic of Graphs V: On Closing the Gap Between Definability and Recognizability , 1991, Theor. Comput. Sci..

[11]  Hannu Niemistö.  On locality and uniform reduction , 2005, 20th Annual IEEE Symposium on Logic in Computer Science (LICS' 05).

[12]  Denis Lapoire,et al.  Recognizability Equals Monadic Second-Order Definability for Sets of Graphs of Bounded Tree-Width , 1998, STACS.

[13]  Jörg Flum,et al.  Finite model theory , 1995, Perspectives in Mathematical Logic.

[14]  Tobias Ganzow,et al.  Order-Invariant MSO is Stronger than Counting MSO in the Finite , 2007, STACS.

[15]  Hubert Comon,et al.  Tree automata techniques and applications , 1997 .

[16]  Paul D. Seymour,et al.  Graph minors. III. Planar tree-width , 1984, J. Comb. Theory B.

[17]  Serge Abiteboul,et al.  Foundations of Databases , 1994 .

[18]  Danièle Beauquier,et al.  Factors of Words , 1989, ICALP.

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

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