An Optimal Construction for the Barthelmann-Schwentick Normal Form on Classes of Structures of Bounded Degree

by   André Frochaux, et al.

Building on the locality conditions for first-order logic by Hanf and Gaifman, Barthelmann and Schwentick showed in 1999 that every first-order formula is equivalent to a formula of the shape ∃ x_1 ∃ x_k ∀ y ϕ where quantification in ϕ is relativised to elements of distance ≤ r from y. Such a formula will be called Barthelmann-Schwentick normal form (BSNF) in the following. However, although the proof is effective, it leads to a non-elementary blow-up of the BSNF in terms of the size of the original formula. We show that, if equivalence on the class of all structures, or even only finite forests, is required, this non-elementary blow-up is indeed unavoidable. We then examine restricted classes of structures where more efficient algorithms are possible. In this direction, we show that on any class of structures of degree ≤ 2, BSNF can be computed in 2-fold exponential time with respect to the size of the input formula. And for any class of structures of degree ≤ d for some d≥ 3, this is possible in 3-fold exponential time. For both cases, we provide matching lower bounds.


page 1

page 2

page 3

page 4


Canonization for Bounded and Dihedral Color Classes in Choiceless Polynomial Time

In the quest for a logic capturing PTime the next natural classes of str...

An Elementary Proof of the Generalization of the Binet Formula for k-bonacci Numbers

We present an elementary proof of the generalization of the k-bonacci Bi...

On the first-order transduction quasiorder of hereditary classes of graphs

Logical transductions provide a very useful tool to encode classes of st...

On the Width of Regular Classes of Finite Structures

In this work, we introduce the notion of decisional width of a finite re...

General Boolean Formula Minimization with QBF Solvers

The minimization of propositional formulae is a classical problem in log...

Learning Concepts Described by Weight Aggregation Logic

We consider weighted structures, which extend ordinary relational struct...

Efficient and Compact Spreadsheet Formula Graphs

Spreadsheets are one of the most popular data analysis tools, wherein us...

Please sign up or login with your details

Forgot password? Click here to reset